g0001_0100.s0066_plus_one.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java17 Show documentation
Show all versions of leetcode-in-java17 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
package g0001_0100.s0066_plus_one;
// #Easy #Top_Interview_Questions #Array #Math
public class Solution {
public int[] plusOne(int[] digits) {
int num = 1;
int carry = 0;
int sum;
for (int i = digits.length - 1; i >= 0; i--) {
if (i == digits.length - 1) {
sum = digits[i] + carry + num;
} else {
sum = digits[i] + carry;
}
carry = sum / 10;
digits[i] = sum % 10;
}
if (carry != 0) {
int[] ans = new int[digits.length + 1];
ans[0] = carry;
System.arraycopy(digits, 0, ans, 1, ans.length - 1);
return ans;
}
return digits;
}
}