[leetcode]66. Plus One(Java)
来源:互联网 发布:如何激活windows 编辑:程序博客网 时间:2024/06/04 16:00
https://leetcode.com/problems/plus-one/#/description
Given a non-negative integer represented as a non-empty array of digits, plus one to the integer.
You may assume the integer do not contain any leading zero, except the number 0 itself.
The digits are stored such that the most significant digit is at the head of the list.
思路:本道题中,给定的数组digits表示一个正整数。现在要把这个正整数+1.重点就是要考虑进位问题从最后一位往前遍历,每一位如果是9,那么i-1。循环
如果当前为不为9,当前+1返回。
如果当前位为9,且i=0。新建一个数组res,长度为digits.length+1,第一位为1,其余为0。返回res
Java code:
package go.jacob.day623;public class Demo2 {public int[] plusOne(int[] digits) {int n = digits.length; for(int i=n-1; i>=0; i--) { if(digits[i] < 9) { digits[i]++; return digits; } digits[i] = 0; } //如果运行到这里,说明原数组重全部都为9.设最高位位1.其他位默认为0; int[] newNumber = new int [n+1]; newNumber[0] = 1; return newNumber;}}
阅读全文
0 0
- (Java)LeetCode-66. Plus One
- 【leetcode】66. Plus One【java】
- [LeetCode] 66. Plus One java
- [leetcode]66. Plus One(Java)
- [Leetcode] Plus One (Java)
- [LeetCode][Java] Plus One
- Leetcode:66. Plus One(JAVA)
- [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
- SDUT-1201 字符串排序
- HTTP、TCP/IP、Socket的不同
- javascript你不知道的This
- ArrayList的toArray
- php实现页面静态化
- [leetcode]66. Plus One(Java)
- 【面试题】剑指offer19--二叉树的镜像
- 用client-go二开kubernetes glide的golang 的包管理
- 生化危机 (深搜 建图)
- linux下VIM的使用(必看)
- HTTP长连接和短连接 + Websocket
- Nginx允许跨域访问的配置问题
- sql行转列
- webstrom自动编译sass文件为css