Given a binary string s
, return the minimum number of character swaps to make it alternating, or -1
if it is impossible.
The string is called alternating if no two adjacent characters are equal. For example, the strings "010"
and "1010"
are alternating, while the string "0100"
is not.
Any two characters may be swapped, even if they are not adjacent.
Example 1:
Input: s = "111000" Output: 1 Explanation: Swap positions 1 and 4: "111000" -> "101010" The string is now alternating.
Example 2:
Input: s = "010" Output: 0 Explanation: The string is already alternating, no swaps are needed.
Example 3:
Input: s = "1110" Output: -1
Constraints:
1 <= s.length <= 1000
s[i]
is either'0'
or'1'
.
Solution: Greedy
Two passes, make the string starts with ‘0’ or ‘1’, count how many 0/1 swaps needed. 0/1 swaps must equal otherwise it’s impossible to swap.
Time complexity: O(n)
Space complexity: O(1)
C++
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 |
// Author: Huahua class Solution { public: int minSwaps(string s) { auto count = [&](int m) { vector<int> swaps(2); for (int i = 0; i < s.length(); ++i, m ^= 1) if (s[i] - '0' != m) ++swaps[s[i] - '0']; return swaps[0] == swaps[1] ? swaps[0] : INT_MAX; }; int ans = min(count(0), count(1)); return ans != INT_MAX ? ans : -1; } }; |