mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
41 lines
2.1 KiB
HTML
41 lines
2.1 KiB
HTML
|
<p>You are given a <strong>0-indexed</strong> binary string <code>s</code> of length <code>n</code> on which you can apply two types of operations:</p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li>Choose an index <code>i</code> and invert all characters from index <code>0</code> to index <code>i</code> (both inclusive), with a cost of <code>i + 1</code></li>
|
||
|
|
<li>Choose an index <code>i</code> and invert all characters from index <code>i</code> to index <code>n - 1</code> (both inclusive), with a cost of <code>n - i</code></li>
|
||
|
|
</ul>
|
||
|
|
|
||
|
|
<p>Return <em>the <strong>minimum cost </strong>to make all characters of the string <strong>equal</strong></em>.</p>
|
||
|
|
|
||
|
|
<p><strong>Invert</strong> a character means if its value is '0' it becomes '1' and vice-versa.</p>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong class="example">Example 1:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> s = "0011"
|
||
|
|
<strong>Output:</strong> 2
|
||
|
|
<strong>Explanation:</strong> Apply the second operation with <code>i = 2</code> to obtain <code>s = "0000" for a cost of 2</code>. It can be shown that 2 is the minimum cost to make all characters equal.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p><strong class="example">Example 2:</strong></p>
|
||
|
|
|
||
|
|
<pre>
|
||
|
|
<strong>Input:</strong> s = "010101"
|
||
|
|
<strong>Output:</strong> 9
|
||
|
|
<strong>Explanation:</strong> Apply the first operation with i = 2 to obtain s = "101101" for a cost of 3.
|
||
|
|
Apply the first operation with i = 1 to obtain s = "011101" for a cost of 2.
|
||
|
|
Apply the first operation with i = 0 to obtain s = "111101" for a cost of 1.
|
||
|
|
Apply the second operation with i = 4 to obtain s = "111110" for a cost of 2.
|
||
|
|
Apply the second operation with i = 5 to obtain s = "111111" for a cost of 1.
|
||
|
|
The total cost to make all characters equal is 9. It can be shown that 9 is the minimum cost to make all characters equal.
|
||
|
|
</pre>
|
||
|
|
|
||
|
|
<p> </p>
|
||
|
|
<p><strong>Constraints:</strong></p>
|
||
|
|
|
||
|
|
<ul>
|
||
|
|
<li><code>1 <= s.length == n <= 10<sup>5</sup></code></li>
|
||
|
|
<li><code>s[i]</code> is either <code>'0'</code> or <code>'1'</code></li>
|
||
|
|
</ul>
|