Leetcode 1864. 构成交替字符串需要的最小交换次数（DAY 132） ---- 贪心算法学习期

客官°小女子只卖身不卖艺 2022-10-05 04:44 157阅读 0赞

## 原题题目 ##

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM3NTAwNTE2_size_16_color_FFFFFF_t_70]

--------------------

## 代码实现（首刷自解） ##

class Solution { 
    public:
        int minSwaps(string s) { 
            int retone = 0,retzero = 0,one = 0,zero = 0;
            for(int i=0;i<s.size();++i)
            { 
                if(s[i] == '0')
                { 
                    if(i%2) ++retzero;
                    else    ++retone; 
                    ++zero;  
                } 
                else
                { 
                    if(i%2) ++retone;
                    else    ++retzero;
                    ++one;
                }
            }
            if(abs(zero-one) > 1)    return -1;
            if(zero == one) return min(retzero/2,retone/2);
            else    if(zero > one)  return retzero/2;
            else    return retone/2;
        }
    };

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3FxXzM3NTAwNTE2_size_16_color_FFFFFF_t_70]: /images/20221005/dd070079621f4c89acdfa67b6f428017.png