-
-
Notifications
You must be signed in to change notification settings - Fork 299
/
926.java
60 lines (51 loc) · 1.59 KB
/
926.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
__________________________________________________________________________________________________
sample 2 ms submission
class Solution {
public int minFlipsMonoIncr(String S) {
char[] cs = S.toCharArray();
int zc = 0; // 0s count
int oc = 0; // 1s count
for (char c : cs) {
if (c == '0') {
zc++;
} else {
oc++;
}
}
int min = Math.min(zc, oc);
int flips_2 = zc;
int flips_1 = 0;
for (int i = 0; i < cs.length; i++) {
if (cs[i] == '1') {
min = Math.min(min, flips_1 + flips_2);
flips_1++;
} else {
flips_2--;
}
}
return min;
}
}
__________________________________________________________________________________________________
sample 37356 kb submission
class Solution {
public int minFlipsMonoIncr(String S) {
int len = S.length();
int[] left2Right = new int[len];
left2Right[0] = S.charAt(0) - '0';
for (int i = 1; i < len; i++) {
left2Right[i] = left2Right[i - 1] + S.charAt(i) - '0';
}
int[] right2Left = new int[len];
right2Left[len - 1] = S.charAt(len - 1) == '1' ? 0 : 1;
for (int i = len - 2; i >= 0; i--) {
right2Left[i] = right2Left[i + 1] + (S.charAt(i) == '1' ? 0 : 1);
}
int res = Integer.MAX_VALUE;
for (int i = 0; i < len; i++) {
res = Math.min(res, left2Right[i] + right2Left[i] - 1);
}
return res;
}
}
__________________________________________________________________________________________________