1247. Minimum Swaps to Make Strings Equal**

1247. Minimum Swaps to Make Strings Equal**

https://leetcode.com/problems/minimum-swaps-to-make-strings-equal/

题目描述

You are given two strings s1 and s2 of equal length consisting of letters "x" and "y" only. Your task is to make these two strings equal to each other. You can swap any two characters that belong to different strings, which means: swap s1[i] and s2[j].

Return the minimum number of swaps required to make s1 and s2 equal, or return -1 if it is impossible to do so.

Example 1:

Input: s1 = "xx", s2 = "yy"
Output: 1
Explanation: 
Swap s1[0] and s2[1], s1 = "yx", s2 = "yx".

Example 2:

Input: s1 = "xy", s2 = "yx"
Output: 2
Explanation: 
Swap s1[0] and s2[0], s1 = "yy", s2 = "xx".
Swap s1[0] and s2[1], s1 = "xy", s2 = "xy".
Note that you can't swap s1[0] and s1[1] to make s1 equal to "yx", cause we can only swap chars in different strings.

Example 3:

Input: s1 = "xx", s2 = "xy"
Output: -1

Example 4:

Input: s1 = "xxyyxyxyxx", s2 = "xyyxyxxxyx"
Output: 4

Constraints:

• 1 <= s1.length, s2.length <= 1000
• s1, s2 only contain 'x' or 'y'.

C++ 实现 1

参考 C++ simple solution, 作者的解释是:

The two first examples give the key to the solution
Everytime there is a difference it is either an (x,y) pair or an (y,x) pair
As seen in example 1, two pairs of (x,y) or two pairs of (y,x) can be fixed in one swap
But one pair of (x,y) and one pair of (y,x) need two swaps to be fixed, as seen in example 2

比如 example 4 中:

class Solution {
public:
    int minimumSwap(string s1, string s2) {
        if (s1.size() != s2.size()) return -1;
        int xy = 0, yx = 0;
        for (int i = 0; i < s1.size(); ++ i) {
            if (s1[i] == 'x' && s2[i] == 'y') xy += 1;
            else if (s1[i] == 'y' && s2[i] == 'x') yx += 1;
        }
        if (xy % 2 != yx % 2) return -1; // xy 与 yx 要么同为偶数, 要么同为奇数才行
        return xy / 2 + yx / 2 + (xy % 2) * 2;
    }
};