-
Notifications
You must be signed in to change notification settings - Fork 0
/
PlusOne.java
67 lines (54 loc) · 1.41 KB
/
PlusOne.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
package array;
import java.util.Arrays;
public class PlusOne {
public static void main(String[] args) {
int[] testArray = new int[]{8, 9, 9, 9};
System.out.println(Arrays.toString(new PlusOne().plusOne(testArray)));
}
public int[] plusOne(int[] digits) {
for (Integer digit : digits) {
if (digit != 9) {
return incrementDigit(digits);
}
}
int[] resArray = new int[digits.length + 1];
resArray[0] = 1;
for (int i = 1; i < resArray.length; i++) {
resArray[i] = 0;
}
return resArray;
}
public int[] incrementDigit(int[] digits) {
for (int i = digits.length - 1; i >= 0; i--) {
if (digits[i] < 9) {
digits[i] = ++digits[i];
return digits;
} else digits[i] = 0;
}
return digits;
}
}
/*
The optimal solution
* public int[] plusOne(int[] digits) {
int N = digits.length-1;
int carry=1;
for(int i=N;i>=0;i--)
{
int temp=digits[i]+carry;
digits[i] = temp%10;
carry = temp/10;
}
if(carry==1)
{
int R[] = new int[N+2];
for(int i=N;i>=0;i--)
{
R[N+1]=digits[N];
}
R[0]=1;
return R;
}
return digits;
}
* */