minimum-changes-to-make-alternating-binary-string

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

You are given a string <code>s</code> consisting only of the characters <code>&#39;0&#39;</code> and <code>&#39;1&#39;</code>. In one operation, you can change any <code>&#39;0&#39;</code> to <code>&#39;1&#39;</code> or vice versa.

The string is called alternating if no two adjacent characters are equal. For example, the string <code>&quot;010&quot;</code> is alternating, while the string <code>&quot;0100&quot;</code> is not.

Return the minimum number of operations needed to make <code>s</code> alternating.

&nbsp;
Example 1:

<pre>
Input: s = &quot;0100&quot;
Output: 1
Explanation: If you change the last character to &#39;1&#39;, s will be &quot;0101&quot;, which is alternating.
</pre>

Example 2:

<pre>
Input: s = &quot;10&quot;
Output: 0
Explanation: s is already alternating.
</pre>

Example 3:

<pre>
Input: s = &quot;1111&quot;
Output: 2
Explanation: You need two operations to reach &quot;0101&quot; or &quot;1010&quot;.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= s.length &lt;= 104</code></li>
	<li><code>s[i]</code> is either <code>&#39;0&#39;</code> or <code>&#39;1&#39;</code>.</li>
</ul>