---
tags: AC LeetCode 刷題讀書會 - 2023
---

# 2023/06/04(日) 每週 LeetCode 刷題

## 刷題題號
- [66. Plus One](https://leetcode.com/problems/plus-one/)

## 解題思路
You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading 0's.
Increment the large integer by one and return the resulting array of digits.
<pre style='background-color:#ggg'>
給予一個陣列組叫做「digits」，裏面的每個元素都是整數，且陣列中的數值由高到低排序，且起始值不會有0。
將一個整數加入1，並回傳到「digits」陣列中。
</pre>

## 回報格式

- 請 Fork 此 Replit 連結(https://replit.com/@AllenLi23/AC-LeetCode-Js-66-Plus-One#index.js)後，進行程式碼解題，並於完成後更新到 Replit 中，再將連結貼至「解題分享區」來與大家交流做法。

解題分享區
---

讀書會議流程：

ex. 21:20開始

#簽到表：
https://docs.google.com/spreadsheets/d/1gc16rrF-yZNs845z_nYrdgDIiSECOJok30dNLyQm69A/edit#gid=534323210

1. 題目說明。
2. 題目解析(BigO(n))。
4. 成員分享解題思路。
5. 問題與討論。

<!-- No.0 (請依序排序下去)
name: name (回報範例)
lighthouse: lighthouse
Replit：https://replit.com/@AllenLi23/AC-LeetCode-Js-66-Plus-One-Allen
-->

<!-- No.1
name: Jack Hung
lighthouse: [e-mail]
Replit：https://replit.com/@LungHsuanHung/AC-LeetCode-Go-66-Plus-One#main.go
-->

<!-- No.2
name: Winnie
lighthouse: [e-mail]
Replit：https://replit.com/@WinnieLin7/AC-LeetCode-Js-66-Plus-One#index.js
-->

<!-- No.3
name: Howard
lighthouse: [e-mail]
Replit：https://replit.com/@asakura4/AC-LeetCode-Js-66-Plus-One#index.js
-->

<!-- No.4
name: vanessa
lighthouse: [e-mail]
Replit：https://replit.com/@vanessalin3/AC-LeetCode-Js-66-Plus-One#index.js
-->

<!-- No.5
name: Kai
lighthouse: [e-mail]
Replit: https://replit.com/@Beginneraboutli/AC-LeetCode-Js-66-Plus-One#index.js
-->

<!-- No.6
name: Bun
lighthouse: [e-mail]
Replit: https://replit.com/@Shu-YinChen/AC-LeetCode-Js-66-Plus-One#index.js
-->

<!-- No.7
name: Jerry
lighthouse: [e-mail]
Replit: Miigun#8103: https://replit.com/@Jerry-Chang975/AC-LeetCode-Js-66-Plus-One#index.js
-->