1758. Minimum Changes To Make Alternating Binary String

最新推荐文章于 2022-11-29 23:12:09 发布

夏天蓝车

最新推荐文章于 2022-11-29 23:12:09 发布

阅读量63

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/weixin_42447161/article/details/114082876

版权

LeetCode 专栏收录该内容

17 篇文章 0 订阅

订阅专栏

You are given a string s consisting only of the characters '0' and '1'. In one operation, you can change any '0' to '1' or vice versa.

The string is called alternating if no two adjacent characters are equal. For example, the string "010" is alternating, while the string "0100" is not.

Return the minimum number of operations needed to make s alternating.

Example 1:

Input: s = "0100"
Output: 1
Explanation: If you change the last character to '1', s will be "0101", which is alternating.

Example 2:

Input: s = "10"
Output: 0
Explanation: s is already alternating.

Example 3:

Input: s = "1111"
Output: 2
Explanation: You need two operations to reach "0101" or "1010".

Constraints:

1 <= s.length <= 104
s[i] is either '0' or '1'.

两种情况，都算一下取小值，就ok

class Solution {
    public int minOperations(String s) {
        int count1 = 0; //10
        for(int i=0; i<s.length(); i++) {
        	if(i%2 == 0) {
        		if(s.charAt(i)!='1') {count1++;}
        	}else {
        		if(s.charAt(i)!='0') {count1++;}
        	}
        }
        
        int count2 = 0; //01
        for(int i=0; i<s.length(); i++) {
        	if(i%2 == 0) {
        		if(s.charAt(i)!='0') {count2++;}
        	}else {
        		if(s.charAt(i)!='1') {count2++;}
        	}
        }
        
        return count1>count2 ? count2:count1;
    }
}