leetcode之Plus One
来源:互联网 发布:无缝纹理制作软件 编辑:程序博客网 时间:2024/04/28 22:37
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之Plus One
- LeetCode之Plus One
- leetcode之plus one
- leetcode之Plus One
- leetcode之plus One
- leetcode之Plus One
- 【Leetcode】之Plus One
- leetcode数组之Plus One
- Leetcode之Plus One 问题
- LeetCode算法题之Plus One
- LeetCode 之 Plus One — C 实现
- LeetCode: Plus One
- LeetCode Plus One
- [Leetcode] Plus One
- LeetCode: Plus One
- hdu1533 Going Home (KM算法最小权值和)
- Android项目实战--手机卫士10--GPS定位与发送短信指令
- Android入门笔记之菜单 (选项菜单和上下文菜单)
- [K/3Cloud]K3Cloud的移动审批方面
- chap3 文件I/O
- leetcode之Plus One
- 【2005 第几天?】
- 【D3.js数据可视化系列教程】--(十一)散点图
- [K/3Cloud]实现双击列表行后显示具体的某个单据明细。
- 计算学习理论PAC模型
- android模拟器获取到root权限
- 简单的用反射实现工厂模式
- DotNET WinForm FAQ 16个
- freemark学习笔记