LeetCode: Plus One
2014-11-03 14:17
316 查看
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.
Round 2:
Round 3:
class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
int carry = 1;
for(int i = digits.size()-1; i >= 0; i--)
{
int temp = digits[i];
digits[i] = (digits[i] + carry) % 10;
carry = (temp + carry) > 9 ? 1 : 0;
}
if(carry > 0)
{
digits.insert(digits.begin(), carry);
}
return digits;
}
};
The digits are stored such that the most significant digit is at the head of the list.
class Solution { public: vector<int> plusOne(vector<int> &digits) { int carry = 1; for(int i = digits.size()-1; i >= 0; i--) { if(digits[i] < 9) { digits[i] += carry; break; } else { digits[i] = 0; if(i == 0) { digits.insert(digits.begin(), 1); break; } } } return digits; } };
Round 2:
class Solution { public: vector<int> plusOne(vector<int> &digits) { int carry = 1; for(int i = digits.size()-1; i >= 0; i--) { if(digits[i] + carry > 9) { digits[i] = (digits[i] + carry) % 10; carry = 1; } else { digits[i] = digits[i] + carry; carry = 0; } } if(carry == 1) digits.insert(digits.begin(), 1); return digits; } };
Round 3:
class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
int carry = 1;
for(int i = digits.size()-1; i >= 0; i--)
{
int temp = digits[i];
digits[i] = (digits[i] + carry) % 10;
carry = (temp + carry) > 9 ? 1 : 0;
}
if(carry > 0)
{
digits.insert(digits.begin(), carry);
}
return digits;
}
};
相关文章推荐
- Leetcode_plus-one(c++ and python updated)
- Leetcode Plus One
- [LeetCode]Length of Last Word&Plus One
- LeetCode(66)Plus One
- leetcode数组之Plus One
- [Leetcode] 369. Plus One Linked List 解题报告
- LeetCode(66)Plus One
- [LeetCode] 369. Plus One Linked List 链表加一运算
- LeetCode(67)Plus One
- LeetCode Plus One
- LeetCode Plus One
- leetcode Plus One
- Plus One leetcode
- leetcode之Plus One
- LeetCode Plus One
- LeetCode Plus One
- [leetcode] 369. Plus One Linked List 解题报告
- [leetcode 66]Pluss One
- LeetCode Plus One
- Plus One leetcode java