Minimum Changes To Make Alternating Binary String LeetCode solution in Python

1
# Runtime: 52 ms (Top 66.2%) | Memory: 16.53 MB (Top 16.1%)
2

3

4
class Solution:
5
    def minOperations(self, s: str) -> int:
6
        count = 0
7
        count1 = 0
8
        for i in range(len(s)):
9
            if i % 2 == 0:
10
                if s[i] == "1":
11
                    count += 1
12
                if s[i] == "0":
13
                    count1 += 1
14
            else:
15
                if s[i] == "0":
16
                    count += 1
17
                if s[i] == "1":
18
                    count1 += 1
19
        return min(count, count1)