LeetCode Plus One
2014-01-06 20:14
197 查看
做过,easy,都没测试。
vector<int> plusOne(vector<int> &digits) { int len = digits.size(); for (int i=len-1;i>=0;i--) { if (digits[i]<9) { digits[i]++; break; } else { digits[i]=0; } } if (digits[0]==0) { vector<int>::iterator iter = digits.begin(); digits.insert(iter,1,1); } return digits; }
相关文章推荐
- Leetcode Plus One
- leetcode数组之Plus One
- LeetCode "Plus One Linked List"
- LeetCode Plus One Java版解题报告
- leetcode Plus One
- LeetCode Plus One
- LeetCode Plus One
- LeetCode之PlusONE
- [Leetcode] 369. Plus One Linked List 解题报告
- LeetCode Plus One
- Leetcode Plus One
- leetcode 66.Plus One python
- leetcode Plus One
- LeetCode 369. Plus One Linked List
- leetcode之Plus One
- Plus One leetcode java
- <LeetCode OJ> 66. Plus One
- leetcode之plus One
- leetcode第66题Plus One
- leetcode Plus One