import java.util.Arrays; class Solution { public int[] plusOne(int[] digits) { int carry = 1; for (int i = digits.length - 1;i >= 0;-- i) { digits[i] = digits[i] + carry; carry = digits[i] / 10; digits[i] = digits[i] % 10; } if (carry == 1) { int[] result = new int[digits.length + 1]; result[0] = 1; System.arraycopy(digits, 0, result, 1, digits.length); return result; } return digits; } }
LeetCode - 66. 加一
猜你喜欢
转载自blog.51cto.com/tianyiya/2172783
今日推荐
周排行