LeetCode--66. Plus One
来源:互联网 发布:俄罗斯经济知乎 编辑:程序博客网 时间:2024/06/16 02:06
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.
给出一个数组,这个数组的每一元素代表这个十进制数的位数,如[3,4,5]代表345. 求加1后的结果,结果也以数组这种形式返回
public class Solution {
public int[] plusOne(int[] digits) {
int length = digits.length;
int res = 1;
for(int i = 0; i < length; i++){
int sum = digits[length-1-i]+res;
digits[length-1-i] = sum%10 ;
res = sum/10;
}
if(res!=0){
int[] result = new int[length+1];
for(int i =0; i < length; i++){
result[i] = digits[i];
}
result[0] = res;
return result;
}
return digits;
}
}
- [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
- 66. Plus One LeetCode
- 【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
- h5py/api_compat.h:27:18: error: hdf5.h: No such file or directory
- Java线程总结(七):并发包------线程通信condition
- 372.Delete Node in the Middle of Singly Linked List-在O(1)时间复杂度删除链表节点(容易题)
- Java中使用Jedis操作Redis
- [html5]轮播文字/图片
- LeetCode--66. Plus One
- Cookie实现记录上一次的登陆时间以及删除Cookie
- 直接选择排序
- latex 常见错误提示及原因简析
- ArcGIS for Server的SOE开发思路解析
- 同步请求和异步请求
- Node.Js Stream(流)-(三)
- html页面js实现页面弹框
- brew link conf 错误