Leetcode Problem.66—Plus One
来源:互联网 发布:淘宝发票抬头设置 编辑:程序博客网 时间:2024/06/13 13:19
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.
My C++ solution!
vector<int> plusOne(vector<int>& digits) { int len=digits.size(); int temp; int jinwei=0; for(int i=len-1;i>=0;i--) { temp=i==(len-1)?(digits[i]+1+jinwei):digits[i]+jinwei; digits[i]=temp%10; jinwei=temp/10; } if(jinwei==1) digits.insert(digits.begin(),1); return digits; }
0 0
- Leetcode Problem.66—Plus One
- leetcode 66 Plus One
- [leetcode 66] Plus One
- [LeetCode 66]Plus One
- leetcode ||66、 Plus One
- leetcode-66 plus one
- LeetCode 66 Plus One
- Plus One - LeetCode 66
- leetcode-66 Plus One
- Leetcode[66]-Plus One
- 【leetcode】【66】Plus One
- leetcode[66]:Plus One
- leetcode-66-Plus One
- leetcode 66:plus one
- Leetcode# 66 Plus One
- leetcode 66: Plus One
- [LeetCode]66-Plus One
- Leetcode#66||Plus One
- java-零散知识点
- Windows GetAsyncKeyState(vk_code)
- 初识聚类算法:K均值、凝聚层次聚类和DBSCAN
- Hive的UDF
- shell脚本中,查找某个文件并执行,排除某个目录
- Leetcode Problem.66—Plus One
- ios UIImage修改大小后图片模糊解决办法
- Python使用lambda排序
- Matlab符号微积分练习
- 关于Intent的Flag属性的讲解
- Git Server搭建
- 软件设计之自顶向下
- 【HDU】5247-找连续数(直接暴力)
- iOS显示隐藏状态栏