66. Plus One 难度:easy
2017-01-07 12:32
267 查看
题目:
Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.
You may assume the integer do not contain any leading zero, except the number 0 itself.
The digits are stored such that the most significant digit is at the head of the list.
思路:
遍历数组的每位,同时处理进位,如果最后还有进位,则在数组最前面在插入1即可。
程序:
class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
int c = 1;
for(int i = digits.size() - 1; i >= 0; -- i)
{
int a = digits[i] + c;
digits[i] = a % 10;
c = a / 10;
}
if(c == 1)
digits.insert(digits.begin(), 1);
return digits;
}
};
Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.
You may assume the integer do not contain any leading zero, except the number 0 itself.
The digits are stored such that the most significant digit is at the head of the list.
思路:
遍历数组的每位,同时处理进位,如果最后还有进位,则在数组最前面在插入1即可。
程序:
class Solution {
public:
vector<int> plusOne(vector<int>& digits) {
int c = 1;
for(int i = digits.size() - 1; i >= 0; -- i)
{
int a = digits[i] + c;
digits[i] = a % 10;
c = a / 10;
}
if(c == 1)
digits.insert(digits.begin(), 1);
return digits;
}
};
相关文章推荐
- Leet Code OJ 66. Plus One [Difficulty: Easy]
- 66. Plus One [easy] (Python)
- Easy 66题 Plus One
- LeetCode-66-Plus One(水题/数值计算)-Easy
- 【LeetCode】(66)Plus One (Easy)
- LeetCode】66.Plus One(easy)解题报告
- Leetcode 66. Plus One (Easy) (cpp)
- LeetCode66. Plus One-python(easy)
- Easy-题目30:66. Plus One
- Easy 14 Plus One(66)
- [Leetcode 66, Easy] Plus One
- 66. Plus One
- 383. Ransom Note 难度:easy
- 66. Plus One
- 66. Plus One
- leetcode 66. Plus One
- leetcode--66.Plus One
- leetcode 066 Plus One(难易度:Easy)
- [Leetcode]@python 66. Plus One
- leetcode 66.Plus One(简单大数模拟)