-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDay2_plusOne.java
More file actions
66 lines (62 loc) · 1.76 KB
/
Day2_plusOne.java
File metadata and controls
66 lines (62 loc) · 1.76 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
55
56
57
58
59
60
61
62
63
64
65
66
import java.util.Arrays;
public class Day2_plusOne {
// day2
// 数组+1
// https://leetcode-cn.com/problems/plus-one/
public int[] plusOne(int[] digits) {
int j = 0;
if (digits[digits.length - 1] + 1 == 10) {
digits[digits.length - 1] = 0;
j = 1;
} else {
digits[digits.length - 1] = digits[digits.length - 1] + 1;
j = 0;
}
for (int i = digits.length - 2; i >= 0; i--) {
if (j == 1) {
if (digits[i] + 1 == 10) {
digits[i] = 0;
j = 1;
} else {
digits[i] = digits[i] + 1;
j = 0;
}
}
}
if (j == 0) {
return digits;
} else {
int[] arr = Arrays.copyOf(digits, digits.length + 1);
//循环将数字后移
for (int i = arr.length - 1; i > 0; i--) {
arr[i] = arr[i - 1];
}
//将指定数字放到指定下标上
arr[0] = 1;
return arr;
}
}
public int[] plusOne2(int[] digits) {
int j = 1;
for (int i = digits.length - 1; i >= 0; i--) {
if (digits[i] + 1 == 10) {
digits[i] = 0;
j = 1;
} else {
digits[i] = digits[i] + 1;
return digits;
}
}
digits = new int[digits.length + 1];
digits[0] = 1;
return digits;
}
public static void main(String args[]) {
int data[] = new int[3];
data[0] = 1;
data[1] = 8;
data[2] = 8;
int data1[] = new Day2_plusOne().plusOne(data);
System.out.println(data1[2]);
}
}