leetcode_question_66 Plus One
2013-09-25 12:34
337 查看
Given a number represented as an array of digits, plus one to the number.
vector<int> plusOne(vector<int> &digits) { // Start typing your C/C++ solution below // DO NOT write int main() function int length = digits.size(); if(length==0) return digits; bool carry = true; int index = length-1; while(carry && index >= 0) { digits[index] += carry; if(digits[index] > 9) {digits[index] = 0;carry = true;index--;} else {carry = false; break;} }; if(carry) digits.insert(digits.begin(), 1); return digits; }
相关文章推荐
- LeetCode 66 Plus One
- LeetCode 66. Plus One--数字数组最后一个元素加1,保持进位
- Leetcode 66. Plus One
- [LeetCode]66. Plus One
- 66.[Leetcode]Plus One
- leetcode 66_Plus One C++
- LeetCode66——Plus One
- 【一天一道LeetCode】#66. Plus One
- 【leetcode】【66】Plus One
- LeetCode 66. Plus One
- 2018.3.12 leetcode打卡 #66 plus one
- LeetCode 66 Plus One (Python详解及实现)
- leetcode--66. Plus One
- LeetCode--66. Plus One
- leetcode刷题记录-66. Plus One
- [leetcode]66. Plus One(Java)
- [LeetCode 66] Plus One
- LeetCode: 66. Plus One
- [leetcode] 66.Plus One
- Leetcode-66.Plus one