leetcode plus one
2013-09-12 04:37
507 查看
public int[] plusOne(int[] digits) {
if(digits.length < 1) return null;
String ans = "";
int resi = 0;
for(int i = digits.length - 1; i>=0; i--) {
int cur = 0;
if(i == digits.length - 1) {
cur = 1 + digits[i];
} else {
cur = digits[i] + resi;
}
if(cur < 10) {
resi = 0;
ans = String.valueOf(cur) + ans;
} else {
resi = cur / 10;
ans = String.valueOf(cur % 10) + ans;
}
}
if(resi != 0) {
ans = String.valueOf(resi) + ans;
}
int[] res = new int[ans.length()];
for(int j = 0; j < res.length; j++) {
res[j] = ans.charAt(j) - '0';
}
return res;
}
if(digits.length < 1) return null;
String ans = "";
int resi = 0;
for(int i = digits.length - 1; i>=0; i--) {
int cur = 0;
if(i == digits.length - 1) {
cur = 1 + digits[i];
} else {
cur = digits[i] + resi;
}
if(cur < 10) {
resi = 0;
ans = String.valueOf(cur) + ans;
} else {
resi = cur / 10;
ans = String.valueOf(cur % 10) + ans;
}
}
if(resi != 0) {
ans = String.valueOf(resi) + ans;
}
int[] res = new int[ans.length()];
for(int j = 0; j < res.length; j++) {
res[j] = ans.charAt(j) - '0';
}
return res;
}
相关文章推荐
- leetcode Plus ONE
- LeetCode Plus One
- LeetCode Plus One
- LeetCode_plus-one
- 【LeetCode】66 & 67- Plus One & Add Binary
- Leetcode 369. Plus One Linked List (Medium) (cpp)
- LeetCode "Plus One"
- leetcode之Plus One
- leetcode — plus-one
- Leetcode Plus One
- [leetcode] 369. Plus One Linked List 解题报告
- LeetCode之Plus One
- [LeetCode]Length of Last Word&Plus One
- LeetCode(66)Plus One
- LeetCode: Plus One
- Leetcode: Plus One Linked List
- LeetCode66: Plus One
- LeetCode(66)Plus One
- leetcode Plus One
- [LeetCode] 369. Plus One Linked List 链表加一运算