Leetcode Plus One
2014-10-06 12:27
411 查看
//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.
//digits={9,9,9,9},那么经过函数运算变为{1,0,0,0},也就是把vector中各位存储的数字看成一个整数的各个位,digits[0]为最高位
//The digits are stored such that the most significant digit is at the head of the list.
//digits={9,9,9,9},那么经过函数运算变为{1,0,0,0},也就是把vector中各位存储的数字看成一个整数的各个位,digits[0]为最高位
class Solution { public: vector<int> plusOne(vector<int> &digits) { if(digits.size() == 0){ digits.push_back(1); return digits; } int carry = 0; int i = 0; int current; int size = digits.size(); for(i = size - 1; i >=0 ; i--){ if(i == size -1){ current = (digits[i] + 1); } else { current = (digits[i] + carry); } carry = current / 10; digits[i] = current % 10; } if(carry != 0){ digits.insert(digits.begin(), carry); } return digits; } };
相关文章推荐
- leetcode之plus One
- leetcode第66题Plus One
- Leetcode Plus One
- leetcode Plus one
- leetcode Plus One
- LeetCode "Plus One Linked List"
- leetcode Plus One 加一
- LeetCode之Plus One
- LeetCode Plus One
- LeetCode Plus One
- LeetCode OJ Plus One
- leetcode 66.Plus One python
- leetcode — plus-one
- Leetcode-plus-one
- Plus One Linked List -- LeetCode
- [LeetCode]Plus One@python
- LeetCode Plus One
- leetcode c++ Plus One
- [leetcode]Plus One @ Python
- [LeetCode] Plus One Linked List 链表加一运算