Daily LeetCode – day0123 1758. Minimum Changes To Make Alternating Binary String

// 1758. Minimum Changes To Make Alternating Binary String
class Solution {
    public int minOperations(String s) {
        int startFromZero = 0;
        int startFromOne = 0;
        char[] charArray = s.toCharArray();
        int len = charArray.length;
        for (int i = 0; i < len; ++i) {
            if ((i & 1) == 0) {
                if (charArray[i] == '0') {
                    ++startFromOne;
                } else {
                    ++startFromZero;
                }
            } else {
                if (charArray[i] == '0') {
                    ++startFromZero;
                } else {
                    ++startFromOne;
                }
            }
        }
        return Math.min(startFromZero, startFromOne);
    }
}

学习笔记：
这是一道简单题，计数的题目。
就是分两种情况，0开始或者1开始然后统计一下就可以了。