minimum-number-of-changes-to-make-binary-string-beautiful

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given a 0-indexed binary string <code>s</code> having an even length.

A string is beautiful if it&#39;s possible to partition it into one or more substrings such that:

<ul>
	<li>Each substring has an even length.</li>
	<li>Each substring contains only <code>1</code>&#39;s or only <code>0</code>&#39;s.</li>
</ul>

You can change any character in <code>s</code> to <code>0</code> or <code>1</code>.

Return the minimum number of changes required to make the string <code>s</code> beautiful.

&nbsp;
Example 1:

<pre>
Input: s = &quot;1001&quot;
Output: 2
Explanation: We change s[1] to 1 and s[3] to 0 to get string &quot;1100&quot;.
It can be seen that the string &quot;1100&quot; is beautiful because we can partition it into &quot;11|00&quot;.
It can be proven that 2 is the minimum number of changes needed to make the string beautiful.
</pre>

Example 2:

<pre>
Input: s = &quot;10&quot;
Output: 1
Explanation: We change s[1] to 1 to get string &quot;11&quot;.
It can be seen that the string &quot;11&quot; is beautiful because we can partition it into &quot;11&quot;.
It can be proven that 1 is the minimum number of changes needed to make the string beautiful.
</pre>

Example 3:

<pre>
Input: s = &quot;0000&quot;
Output: 0
Explanation: We don&#39;t need to make any changes as the string &quot;0000&quot; is beautiful already.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>2 &lt;= s.length &lt;= 105</code></li>
	<li><code>s</code> has an even length.</li>
	<li><code>s[i]</code> is either <code>&#39;0&#39;</code> or <code>&#39;1&#39;</code>.</li>
</ul>

minChanges

Minimum Number of Changes to Make Binary String Beautiful

String

给你一个长度为偶数下标从 0&nbsp;开始的二进制字符串&nbsp;<code>s</code>&nbsp;。

如果可以将一个字符串分割成一个或者更多满足以下条件的子字符串，那么我们称这个字符串是 美丽的&nbsp;：

<ul>
	<li>每个子字符串的长度都是 偶数&nbsp;。</li>
	<li>每个子字符串都 只&nbsp;包含 <code>1</code>&nbsp;或 只&nbsp;包含 <code>0</code>&nbsp;。</li>
</ul>

你可以将 <code>s</code>&nbsp;中任一字符改成&nbsp;<code>0</code>&nbsp;或者&nbsp;<code>1</code>&nbsp;。

请你返回让字符串 <code>s</code>&nbsp;美丽的&nbsp;最少&nbsp;字符修改次数。

&nbsp;

示例 1：

<pre>
输入：s = "1001"
输出：2
解释：我们将 s[1] 改为 1 ，且将 s[3] 改为 0 ，得到字符串 "1100" 。
字符串 "1100" 是美丽的，因为我们可以将它分割成 "11|00" 。
将字符串变美丽最少需要 2 次修改。
</pre>

示例 2：

<pre>
输入：s = "10"
输出：1
解释：我们将 s[1] 改为 1 ，得到字符串 "11" 。
字符串 "11" 是美丽的，因为它已经是美丽的。
将字符串变美丽最少需要 1 次修改。
</pre>

示例 3：

<pre>
输入：s = "0000"
输出：0
解释：不需要进行任何修改，字符串 "0000" 已经是美丽字符串。
</pre>

&nbsp;

提示：

<ul>
	<li><code>2 &lt;= s.length &lt;= 105</code></li>
	<li><code>s</code>&nbsp;的长度为偶数。</li>
	<li><code>s[i]</code>&nbsp;要么是&nbsp;<code>'0'</code>&nbsp;，要么是&nbsp;<code>'1'</code> 。</li>
</ul>