66 Plus One
来源:互联网 发布:python 替换 16进制 编辑:程序博客网 时间:2024/06/05 03:50
public class Solution {
public int[] plusOne(int[] digits) {
if(digits==null||digits.length==0) return null;
int len = digits.length;
int f = 1;
int p = len - 1;
StringBuffer str = new StringBuffer();
while(p>=0){
int tmp = digits[p] + f;
str.append(tmp%10);
f = (tmp - tmp%10)/10;
if(f==0){
--p;
while(p>=0){
str.append(digits[p]);
--p;
}
char[] tmpRes = str.toString().toCharArray();
int tr_len = tmpRes.length;
int[] res = new int[tr_len];
int index = 0;
for(int j=tr_len-1;j>=0;--j){
res[index++] = new Integer(tmpRes[j] - '0');
}
return res;
}
--p;
}
if(f!=0){
str.append(f);
}
char[] tmpRes = str.toString().toCharArray();
int tr_len = tmpRes.length;
int[] res = new int[tr_len];
int index = 0;
for(int j=tr_len-1;j>=0;--j){
res[index++] = new Integer(tmpRes[j] - '0');
}
return res;
}
}
public int[] plusOne(int[] digits) {
if(digits==null||digits.length==0) return null;
int len = digits.length;
int f = 1;
int p = len - 1;
StringBuffer str = new StringBuffer();
while(p>=0){
int tmp = digits[p] + f;
str.append(tmp%10);
f = (tmp - tmp%10)/10;
if(f==0){
--p;
while(p>=0){
str.append(digits[p]);
--p;
}
char[] tmpRes = str.toString().toCharArray();
int tr_len = tmpRes.length;
int[] res = new int[tr_len];
int index = 0;
for(int j=tr_len-1;j>=0;--j){
res[index++] = new Integer(tmpRes[j] - '0');
}
return res;
}
--p;
}
if(f!=0){
str.append(f);
}
char[] tmpRes = str.toString().toCharArray();
int tr_len = tmpRes.length;
int[] res = new int[tr_len];
int index = 0;
for(int j=tr_len-1;j>=0;--j){
res[index++] = new Integer(tmpRes[j] - '0');
}
return res;
}
}
0 0
- leetcode 66 Plus One
- [leetcode 66] Plus One
- 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
- #66 Plus One
- Leetcode[66]-Plus One
- 【leetcode】【66】Plus One
- leetcode[66]:Plus One
- leetcode-66-Plus One
- 66Plus One
- leetcode 66:plus one
- Leetcode# 66 Plus One
- leetcode 66: Plus One
- Android笔记
- 归并排序
- java.lang.Thread.State类详解
- NYOJ 746 整数划分(四)
- HDU 4513 吉哥系列故事——完美队形II(Manacher算法最大回文长度 && 两侧沿中点递减)
- 66 Plus One
- iOS UI14_GET-POST
- 华为OJ平台试题 —— 数组:字符串反转
- android退出应用程序的几种方法
- hdu2454 Degree Sequence of Graph G(havel定理)
- vi常用快捷键
- HDOJ 1242 Rescue【BFS】
- javaweb 同名用户登录剔除退出功能
- hdu1285