leetcode之Plus One
2013-09-08 12:25
218 查看
class Solution {
public:
vector<int> plusOne(vector<int> &digits) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (digits.empty()) {
digits.push_back(1);
return digits;
}
vector<int> nums(digits.rbegin(), digits.rend());
vector<int>::iterator itr = nums.begin();
int carry = 0;
int sum = carry+*itr+1;
while (itr != nums.end()) {
if (sum<10) {
*itr = sum;
carry = 0;
break;
} else {
carry = sum/10;
*itr = sum%10;
}
itr++;
sum = carry+*itr;
}
if (carry >0) {
nums.push_back(carry);
}
vector<int> res (nums.rbegin(), nums.rend());
return res;
}
};
public:
vector<int> plusOne(vector<int> &digits) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (digits.empty()) {
digits.push_back(1);
return digits;
}
vector<int> nums(digits.rbegin(), digits.rend());
vector<int>::iterator itr = nums.begin();
int carry = 0;
int sum = carry+*itr+1;
while (itr != nums.end()) {
if (sum<10) {
*itr = sum;
carry = 0;
break;
} else {
carry = sum/10;
*itr = sum%10;
}
itr++;
sum = carry+*itr;
}
if (carry >0) {
nums.push_back(carry);
}
vector<int> res (nums.rbegin(), nums.rend());
return res;
}
};
相关文章推荐
- LeetCode Plus One
- LeetCode Plus One
- LeetCode Plus One
- LeetCode OJ Plus One
- LeetCode Plus One
- LeetCode--plus-one
- [leetcode] 369. Plus One Linked List 解题报告
- leetcode Plus ONE
- LeetCode Plus One
- LeetCode Plus One
- LeetCode_plus-one
- 【LeetCode】66 & 67- Plus One & Add Binary
- Leetcode 369. Plus One Linked List (Medium) (cpp)
- LeetCode "Plus One"
- leetcode之Plus One
- Leetcode Plus One
- [leetcode] 369. Plus One Linked List 解题报告
- LeetCode之Plus One
- leetcode plus one
- [LeetCode]Length of Last Word&Plus One