leetcode | Plus One
来源:互联网 发布:电子科技集团14所 知乎 编辑:程序博客网 时间:2024/06/08 10:30
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.
public class Solution { public int[] plusOne(int[] digits) { int len = digits.length; for(int i=len-1;i>=0;i--) { // System.out.println(i); if(digits[i]==9) { digits[i]=0; continue; } else { digits[i] ++; return digits; } } int[] newdigits = new int[len+1]; newdigits[0]=1; System.arraycopy(digits,0,newdigits,1,len); return newdigits; }}
0 0
- LeetCode: Plus One
- LeetCode Plus One
- [Leetcode] Plus One
- LeetCode: Plus One
- leetcode 33: Plus One
- [LeetCode] Plus One
- [leetCode] Plus One
- 【leetcode】Plus One
- [LeetCode]Plus One
- [leetcode]Plus One
- LeetCode-Plus One
- [leetcode] plus one
- LeetCode - Plus One
- [LeetCode] Plus one
- LeetCode:Plus One
- leetcode之Plus One
- leetcode plus one
- LeetCode | Plus One
- spring读写文件
- find中的-print0和xargs中-0
- Java动态代理的实现机制
- iOS开发脚踏实地学习day17-彩票
- dom4j读写xml文件
- leetcode | Plus One
- HMAC-SHA1各语言版本实现
- 【转载】Android事件分发机制完全解析,带你从源码的角度彻底理解(下)
- 视图控制器 的生命周期
- 设计模式概览
- \xe4\xb8\xad\xe6\x96\x87 phython 字符编码乱码问题
- Linux Shell 之 Shell 变量
- IIS7.0设置404错误页,返回500状态码
- 那些不安全的库函数