mirror of
https://gitlab.com/mfocko/LeetCode.git
synced 2024-11-14 09:59:41 +01:00
21 lines
441 B
Java
21 lines
441 B
Java
|
class Solution {
|
||
|
public int minOperations(String s) {
|
||
|
int startingZero = 0;
|
||
|
int startingOne = 0;
|
||
|
|
||
|
for (int i = 0; i < s.length(); ++i) {
|
||
|
char c = s.charAt(i);
|
||
|
|
||
|
if (c != '0' + i % 2) {
|
||
|
++startingZero;
|
||
|
}
|
||
|
|
||
|
if (c != '0' + (i + 1) % 2) {
|
||
|
++startingOne;
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return Math.min(startingZero, startingOne);
|
||
|
}
|
||
|
}
|