maximum-number-of-operations-to-move-ones-to-the-end

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 binary string <code>s</code>.

You can perform the following operation on the string any number of times:

<ul>
	<li>Choose any index <code>i</code> from the string where <code>i + 1 &lt; s.length</code> such that <code>s[i] == &#39;1&#39;</code> and <code>s[i + 1] == &#39;0&#39;</code>.</li>
	<li>Move the character <code>s[i]</code> to the right until it reaches the end of the string or another <code>&#39;1&#39;</code>. For example, for <code>s = &quot;010010&quot;</code>, if we choose <code>i = 1</code>, the resulting string will be <code>s = &quot;000110&quot;</code>.</li>
</ul>

Return the maximum number of operations that you can perform.

&nbsp;
Example 1:

<div class="example-block">
Input: s = &quot;1001101&quot;

Output: 4

Explanation:

We can perform the following operations:

<ul>
	<li>Choose index <code>i = 0</code>. The resulting string is <code>s = &quot;0011101&quot;</code>.</li>
	<li>Choose index <code>i = 4</code>. The resulting string is <code>s = &quot;0011011&quot;</code>.</li>
	<li>Choose index <code>i = 3</code>. The resulting string is <code>s = &quot;0010111&quot;</code>.</li>
	<li>Choose index <code>i = 2</code>. The resulting string is <code>s = &quot;0001111&quot;</code>.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: s = &quot;00111&quot;

Output: 0
</div>

&nbsp;
Constraints:

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

maxOperations

Maximum Number of Operations to Move Ones to the End

Greedy

String

Counting

给你一个 二进制字符串 <code>s</code>。

你可以对这个字符串执行 任意次 下述操作：

<ul>
	<li>选择字符串中的任一下标 <code>i</code>（ <code>i + 1 &lt; s.length</code> ），该下标满足 <code>s[i] == '1'</code> 且 <code>s[i + 1] == '0'</code>。</li>
	<li>将字符 <code>s[i]</code> 向 右移 直到它到达字符串的末端或另一个 <code>'1'</code>。例如，对于 <code>s = "010010"</code>，如果我们选择 <code>i = 1</code>，结果字符串将会是 <code>s = "000110"</code>。</li>
</ul>

返回你能执行的 最大 操作次数。

&nbsp;

示例 1：

<div class="example-block">
输入： s = "1001101"

输出： 4

解释：

可以执行以下操作：

<ul>
	<li>选择下标 <code>i = 0</code>。结果字符串为 <code>s = "0011101"</code>。</li>
	<li>选择下标 <code>i = 4</code>。结果字符串为 <code>s = "0011011"</code>。</li>
	<li>选择下标 <code>i = 3</code>。结果字符串为 <code>s = "0010111"</code>。</li>
	<li>选择下标 <code>i = 2</code>。结果字符串为 <code>s = "0001111"</code>。</li>
</ul>
</div>

示例 2：

<div class="example-block">
输入： s = "00111"

输出： 0
</div>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= s.length &lt;= 105</code></li>
	<li><code>s[i]</code> 为 <code>'0'</code> 或 <code>'1'</code>。</li>
</ul>