leetcode—Plus one
2013-08-27 11:54
309 查看
1.题目描述
[code]Given a number represented as an array of digits, plus one to the number. [/code] |
2.解法分析
不要被常规思路限制住,常规思路会遍历整个数组,然后设置进位,但是实际上只需要找到第一位不为9的数字即可,免去了加的必要。
[code]class Solution { public: vector<int> plusOne(vector<int> &digits) { // Start typing your C/C++ solution below // DO NOT write int main() function if(digits.empty())return digits; int len=digits.size(); int i=len-1; while(i>=0) { if(digits[i]==9)digits[i]=0; else{ digits[i]+=1;break; } i--; } if(i<0)digits.insert(digits.begin(),1); return digits; } }; [/code] |
相关文章推荐
- [LeetCode]11. Plus One加一运算
- LeetCode 66 Plus One
- Java for LeetCode 066 Plus One
- 【LeetCode】C# 66、Plus One
- [leetcode] 66. Plus One
- 【leetcode】第66题 Plus One 题目+解析+JAVA代码
- leetcode 66. Plus One
- leetcode:Plus One
- LeetCode 66 - Plus One
- LeetCode笔记:66. Plus One
- LeetCode 066 Plus One
- LeetCode:Plus One, Add Binary, Sqrt(x), Climbing Stairs
- Leetcode 66. Plus One (Easy) (cpp)
- [LeetCode] Plus One
- LeetCode(29)-Plus One
- [LeetCode] 66. Plus One 加一
- LeetCode 66. Plus One(加1)
- leetcode 66. Plus One
- LeetCode -- 66. Plus One
- leetcode:Plus One