注意有进位的情况
func plusOne(digits []int) []int {
l := len(digits)
for i := l - 1; i >= 0; i-- {
if digits[i] < 9 {
digits[i]++
return digits
}
digits[i] = 0
}
//如果有进位
res := []int{1}
res = append(res, digits...)
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 ...
本文标题：66. Plus One.go
本文链接：https://www.haomeiwen.com/subject/etcsvqtx.html
网友评论