[LeetCode] 1758 - Minimum Changes To Make Alternating Binary String

문제

• 링크: https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string
• 난이도: Easy
• 태그: 문자열
• 결과: Time: 0 ms (100%), Space: 16.6 MB (73.7%)

풀이

class Solution {
public:
    int minOperations(string s) {
        int cnt0 = 0;
        int cnt1 = 0;
        for(int i = 0; i < s.size(); ++i)
        {
            char exp0 = i % 2 == 0 ? '0' : '1';
            char exp1 = i % 2 == 1 ? '0' : '1';
            if(s[i] != exp0)
            {
                cnt0++;
            }
            if(s[i] != exp1)
            {
                cnt1++;
            }
        }

        return min(cnt0, cnt1);
    }
};

배운 점과 후기

2진수 왜 이렇게 좋아하니..