maximum-score-after-binary-swaps

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer array <code>nums</code> of length <code>n</code> and a binary string <code>s</code> of the same length.

Initially, your score is 0. Each index <code>i</code> where <code>s[i] = &#39;1&#39;</code> contributes <code>nums[i]</code> to the score.

You may perform any number of operations (including zero). In one operation, you may choose an index <code>i</code> such that <code>0 &lt;= i &lt; n - 1</code>, where <code>s[i] = &#39;0&#39;</code>, and <code>s[i + 1] = &#39;1&#39;</code>, and swap these two characters.

Return an integer denoting the maximum possible score you can achieve.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [2,1,5,2,3], s = &quot;01010&quot;

Output: 7

Explanation:

We can perform the following swaps:

<ul>
	<li>Swap at index <code>i = 0</code>: <code>&quot;01010&quot;</code> changes to <code>&quot;10010&quot;</code></li>
	<li>Swap at index <code>i = 2</code>: <code>&quot;10010&quot;</code> changes to <code>&quot;10100&quot;</code></li>
</ul>

Positions 0 and 2 contain <code>&#39;1&#39;</code>, contributing <code>nums[0] + nums[2] = 2 + 5 = 7</code>. This is maximum score achievable.
</div>

Example 2:

<div class="example-block">
Input: nums = [4,7,2,9], s = &quot;0000&quot;

Output: 0

Explanation:

There are no <code>&#39;1&#39;</code> characters in <code>s</code>, so no swaps can be performed. The score remains 0.
</div>

&nbsp;
Constraints:

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