66. Plus One
来源:互联网 发布:禅道 mysql数据库连接 编辑:程序博客网 时间:2024/06/05 00:20
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.
code:
<span style="font-size:14px;">public class Solution { public int[] plusOne(int[] digits) { int n=digits.length; int flag=1; int temp; for(int i=n-1;i>=0;i--){ temp=digits[i]+flag; flag=temp/10; digits[i]=temp%10; } if(flag>0){ int[] res=new int[n+1]; res[0]=flag; for(int i=1;i<=n;i++) res[i]=digits[i-1]; return res; } return digits; }}</span>
0 0
- [LeetCode]66.Plus One
- LeetCode --- 66. Plus One
- [Leetcode] 66. Plus One
- [leetcode] 66.Plus One
- 66. Plus One
- 66. Plus One
- [leetcode] 66. Plus One
- Leetcode-66. Plus One
- 【leetcode】66. Plus One
- 66. Plus One
- 66. Plus One LeetCode
- 66. Plus One
- 66. Plus One
- 66. Plus One
- 66. Plus One
- 66. Plus One
- 【LeetCode】66. Plus One
- [LeetCode]66. Plus One
- 公私钥加解密问题汇总
- Java_Swing图形界面-1选项卡的创建-2使其靠左垂直对齐
- 【Visual Studio】VS2012中添加模板
- Zookeeper 错误 Will not attempt to authenticate using SASL (unknown error)
- Android中GridView以表格形式显示多张图片(仿桌面)
- 66. Plus One
- opengl学习第三课(点和线的处理)
- 比较好的dx opegl学习相关网站
- 扑克牌洗牌代码
- [Android] 最全内存分析—2016年10月9日
- Python list,tuple,dict,set区别
- 67. Add Binary
- Docker 使用国内加速器
- android,java判断密码强度