We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 83f18eb commit e6ead61Copy full SHA for e6ead61
Plus One/Plus_One.py
@@ -0,0 +1,37 @@
1
+# 第一种思路,简单粗暴
2
+# 36ms 99.84%
3
+class Solution:
4
+ def plusOne(self, digits):
5
+ """
6
+ :type digits: List[int]
7
+ :rtype: List[int]
8
9
+ num = 1
10
+ len_digits = len(digits)
11
+ for index, digit in enumerate(digits):
12
+ num += digit * 10 ** (len_digits - index - 1)
13
+
14
+ return list(map(int, list(str(num))))
15
16
+# 第二种思路,使用进位制
17
18
19
20
21
22
23
24
+ for index in range(len(digits) - 1, -1, -1):
25
+ if index is len(digits) - 1:
26
+ digits[index] += 1
27
+ else:
28
+ digits[index] += carry
29
30
+ if digits[index] >= 10:
31
+ carry = digits[index] // 10
32
+ digits[index] %= 10
33
34
+ carry = 0
35
+ if carry is not 0:
36
+ digits.insert(0, carry)
37
+ return digits
0 commit comments