LeetCode 66 Plus One
来源:互联网 发布:mac软件合集百度云 编辑:程序博客网 时间:2024/06/05 20:36
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.
题意就是:一个十进制数n以位放在数组里面,然后n+1,问数组变成什么样了。如:9999+1=[9,9,9,9]+1=10000=[1,0,0,0]。
代码如下:
public int[] plusOne(int[] digits) {for (int i = digits.length - 1; i >= 0; i--) {if (digits[i] == 9) digits[i] = 0;else {digits[i]++;return digits;}}int[] newDigits = Arrays.copyOf(digits, digits.length + 1);newDigits[0] = 1;newDigits[digits.length] = 0;return newDigits;}
0 0
- 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
- [Leetcode]#66 Plus One
- JavaScript合并两个Json对象
- FFMPEG之TimeBase成员理解
- mysql中用变量做表名的方法
- 正则表达式(参考java编程思想)
- How much common sense have YOU got? Take the test
- LeetCode 66 Plus One
- IP地址的三种表示格式及在Socket编程中的应用
- Java之类的封装,继承,多态
- 主题分析的两篇综述
- Eclipse视图:navigator、 package explorer、 project explorer
- stringbuffer与stringbuilder的区别?
- 在页面加载后在设置embed 的src 怎么实现?
- 轮廓3
- 【经典算法】——KMP,深入讲解next数组的求解