https://leetcode.com/problems/plus-one/description/
解题思路：
本位为9则进位，否则直接+1
代码：
class Solution {
public int[] plusOne(int[] digits) {
if (digits == null) return new int[1];
for(int i = digits.length - 1; i >= 0; i--){
if(digits[i] != 9){
digits[i] += 1;
return digits;
} else {
digits[i] = 0;
}
}
int[] res = new int[digits.length + 1];
res[0] = 1;
return res;
}
}
66. Plus One[https://leetcode-cn.com/problems/plus-one/] ...
66. Plus One 题目：https://leetcode.com/problems/plus-one/ 难...
66. Plus One Given a non-negative integer represented as ...
66. Plus One Description Given a non-empty array of digit...
问题链接 66. 加一[https://leetcode-cn.com/problems/plus-one] 问题...
分类：Math/Array 时间复杂度: O(n) 66. Plus One Given a non-empty ...
66. 加一[https://leetcode-cn.com/problems/plus-one/] 解题思路 1...
题目地址(66. 加一) https://leetcode.cn/problems/plus-one/[https...
Problem Given a non-empty array of digits representing a ...
https://leetcode.com/problems/plus-one/description/解题思路：本...
本文标题：66. Plus One
本文链接：https://www.haomeiwen.com/subject/xwbkvftx.html
网友评论