forked from lgaBug/algorithm014-algorithm014
-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathmain.java
More file actions
54 lines (50 loc) · 1.49 KB
/
main.java
File metadata and controls
54 lines (50 loc) · 1.49 KB
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
package Week_01.Plus_one_66;
import java.util.Arrays;
public class main {
public static void main(String[] args) {
int[] digits = new int[]{1,9,9,9,9,9};
int[] digits1 = new int[]{1,9,9,9,9,8};
int[] digits2 = new int[]{9,9,9,9,9,9};
Solution s = new Solution();
int[] ret = s.plusOne(digits);
int[] ret1 = s.plusOne(digits1);
int[] ret2 = s.plusOne(digits2);
System.out.println(Arrays.toString(ret));
System.out.println(Arrays.toString(ret1));
System.out.println(Arrays.toString(ret2));
}
}
class Solution {
public int[] plusOne(int[] digits) {
int i = digits.length - 1;
for (; i >= 0; i--) {
digits[i] = ( digits[i] + 1 ) % 10;
if ( digits[i] != 0 ) {
return digits;
}
}
int[] ret1 = new int[digits.length + 1];
ret1[0] = 1;
return ret1;
}
public int[] plusOne1(int[] digits) {
int[] ret = new int[digits.length];
int i = digits.length - 1;
int carry = 0;
for (; i >= 0; i--) {
int sum = digits[i] + carry;
if ( i == digits.length - 1) {
sum += 1;
}
ret[i] = sum % 10;
carry = sum / 10;
}
if ( carry == 0 ) {
return ret;
}
int[] ret1 = new int[digits.length + 1];
System.arraycopy(ret, 0, ret1, 1, digits.length);
ret1[0] = 1;
return ret1;
}
}