Repository navigation
Expand file tree
/
Copy pathNumber738单调递增的数字.java
More file actions
80 lines (67 loc) · 1.94 KB
/
Copy pathNumber738单调递增的数字.java
File metadata and controls
80 lines (67 loc) · 1.94 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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
package weekFive;
public class Number738单调递增的数字 {
public static void main(String[] args) {
// System.out.println(monotoneIncreasingDigitsTwo(6478));
System.out.println(monotoneIncreasingDigitsOne(6478));
}
/**
* 普通的for 循环的写法
*
* @param N
* @return
*/
public static int monotoneIncreasingDigitsTwo(int N) {
char[] arr = (N + "").toCharArray();
int max = -1, idx = -1;
for (int i = 0; i < arr.length - 1; i++) {
if (max < arr[i]) {
max = arr[i];
idx = i;
}
if (arr[i] > arr[i + 1]) {
arr[idx] -= 1;
for (int j = idx + 1; j < arr.length; j++) {
arr[j] = '9';
}
break;
}
}
return Integer.parseInt(new String(arr));
}
public static int test(int N) {
char[] chars = (N + "").toCharArray();
int max = -1, idx = -1;
// length
for (int i = 0; i < chars.length - 1; i++) {
if (max < chars[i]) {
max = chars[i];
idx = i;
}
if (chars[i] > chars[i + 1]) {
chars[idx] -= 1;
for (int j = idx + 1; j < chars.length; j++) {
chars[j] = '9';
}
break;
}
}
return Integer.parseInt(new String(chars));
}
/**
* @param N
* @return
*/
public static int monotoneIncreasingDigitsOne(int N) {
for (int i = N, j = 9, k = 1; i > 0; i /= 10, k *= 10) {
if (j < (j = i % 10)) {
System.out.println(i * k);
return monotoneIncreasingDigitsOne(i * k - 1);
}
}
return N;
}
public static int monotoneIncreasingDigitsThree(int N) {
return 1;
}
// Java 递归模版
}