leetcode--Plus One
来源:互联网 发布:仿糗事百科源码 编辑:程序博客网 时间:2024/06/09 18:22
题目:难度(Easy)
Given a non-negative number represented as an array of digits, plus one to the number.
The digits are stored such that the most significant digit is at the head of the list.
Tags:Array Math
Similar Problems:(M) Multiply Strings (E) Add Binary
分析:用数组存数的各个数位,数组的靠前的位置数位越大,如[1,2,3]表示123,加1编程[1,2,4]
代码实现:
class Solution(object): def plusOne(self, digits): """ :type digits: List[int] :rtype: List[int] """ digits.reverse() #进行加1操作 digits[0]+=1 #update digits数组,divmod函数返回(商,余数) for i in range(len(digits)-1): carry, digits[i] = divmod(digits[i], 10) digits[i+1] += carry if digits[len(digits)-1] > 9: digits[len(digits)-1] %= 10 digits.append(1) digits.reverse() return digits
0 0
- LeetCode: Plus One
- LeetCode Plus One
- [Leetcode] Plus One
- LeetCode: Plus One
- leetcode 33: Plus One
- [LeetCode] Plus One
- [leetCode] Plus One
- 【leetcode】Plus One
- [LeetCode]Plus One
- [leetcode]Plus One
- LeetCode-Plus One
- [leetcode] plus one
- LeetCode - Plus One
- [LeetCode] Plus one
- LeetCode:Plus One
- leetcode之Plus One
- leetcode plus one
- LeetCode | Plus One
- ClassNotFound/load XXXX error 的疑问杂症
- android中的动画
- leetcode:Convert Sorted Array to Binary Search Tree
- jQuery自学教程(三)——DOM操作
- 递归与循环的效率问题
- leetcode--Plus One
- javascript--argument&this
- BZOJ_P2324 [ZJOI2011]营救皮卡丘(网络流+最小费用最大流+Floyd)
- Redhat 7.0使用CentOS 7 的Yum 网络源
- Android Wear 8 Using Speakers on Wearables 在手表上面使用扬声器
- Android Shape属性介绍[图文]
- Mongodb 稀疏索引 sparse
- 外包模式
- 外部内部排序,稳定性