[Swift]LeetCode1247. 交换字符使得字符串相同 | Minimum Swaps to Make Strings Equal

★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★
➤微信公众号：山青咏芝（let_us_code）
➤博主域名：https://www.zengqiang.org
➤GitHub地址：https://github.com/strengthen/LeetCode
➤原文地址：https://www.cnblogs.com/strengthen/p/11831454.html
➤如果链接不是山青咏芝的博客园地址，则可能是爬取作者的文章。
➤原文已修改更新！强烈建议点击原文地址阅读！支持作者！支持原创！
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★

热烈欢迎，请直接点击！！！

进入博主App Store主页，下载使用各个作品！！！

注：博主将坚持每月上线一个新app！！！

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'.

---

 

有两个长度相同的字符串 s1 和 s2，且它们其中 只含有 字符 "x" 和 "y"，你需要通过「交换字符」的方式使这两个字符串相同。

每次「交换字符」的时候，你都可以在两个字符串中各选一个字符进行交换。

交换只能发生在两个不同的字符串之间，绝对不能发生在同一个字符串内部。也就是说，我们可以交换 s1[i] 和 s2[j]，但不能交换 s1[i] 和 s1[j]。

最后，请你返回使 s1 和 s2 相同的最小交换次数，如果没有方法能够使得这两个字符串相同，则返回 -1 。 

示例 1：

输入：s1 = "xx", s2 = "yy"
输出：1
解释：
交换 s1[0] 和 s2[1]，得到 s1 = "yx"，s2 = "yx"。
示例 2：

输入：s1 = "xy", s2 = "yx"
输出：2
解释：
交换 s1[0] 和 s2[0]，得到 s1 = "yy"，s2 = "xx" 。
交换 s1[0] 和 s2[1]，得到 s1 = "xy"，s2 = "xy" 。
注意，你不能交换 s1[0] 和 s1[1] 使得 s1 变成 "yx"，因为我们只能交换属于两个不同字符串的字符。
示例 3：

输入：s1 = "xx", s2 = "xy"
输出：-1
示例 4：

输入：s1 = "xxyyxyxyxx", s2 = "xyyxyxxxyx"
输出：4

提示：

1 <= s1.length, s2.length <= 1000
s1, s2 只包含 'x' 或 'y'。

---

0ms

class Solution {
    func minimumSwap(_ s1: String, _ s2: String) -> Int {
        let c1 = Array(s1)
        let c2 = Array(s2)
        var xc = 0
        var yc = 0
        var xc1 = 0
        var yc1 = 0
        
        for i in 0 ..< c1.count {
            if c1[i] != c2[i] {
                if c1[i] == Character("x") {
                    xc += 1
                    xc1 += 1
                } else {
                    yc += 1
                    yc1 += 1
                }
                if c2[i] == Character("x") {
                    xc += 1
                } else {
                    yc += 1
                }
            } else {
                if c1[i] == Character("x") {
                    xc += 2
                } else {
                    yc += 2
                }
            }
        }
        
        if xc % 2 != 0 || yc % 2 != 0 {
            return -1
        } else {
            return xc1 / 2 + yc1 / 2 + xc1 % 2 + yc1 % 2
        }
    }
}

---

Runtime: 4 ms

Memory Usage: 20.9 MB

class Solution {
    func minimumSwap(_ s1: String, _ s2: String) -> Int {
        var x1:Int = 0 // number of 'x' in s1 (skip equal chars at same index)
        var y1:Int = 0 // number of 'y' in s1 (skip equal chars at same index)
        var x2:Int = 0 // number of 'x' in s2 (skip equal chars at same index)
        var y2:Int = 0 // number of 'y' in s2 (skip equal chars at same index)
        let s1:[Character] =  Array(s1)
        let s2:[Character] = Array(s2)
        for i in 0..<s1.count
        {
            let c1 = s1[i]
            let c2 = s2[i]
            if c1 == c2 {continue}
            if c1 == "x" {x1 += 1}
            else {y1 += 1}
            if c2 == "x" {x2 += 1}
            else {y2 += 1}
        }
        // After skip "c1 == c2", check the number of  'x' and 'y' left in s1 and s2.
        if (x1 + x2) % 2 != 0 || (y1 + y2) % 2 != 0
        {
            return -1; // if number of 'x' or 'y' is odd, we can not make s1 equals to s2
        }
        // Cases to do 1 swap:
        // "xx" => x1 / 2 => how many pairs of 'x' we have ?
        // "yy" => y1 / 2 => how many pairs of 'y' we have ?
        //
        // Cases to do 2 swaps:
        // "xy" or "yx" =>  x1 % 2
        return x1 / 2 + y1 / 2 + (x1 % 2) * 2
    }
}

---

4ms

class Solution {
    func minimumSwap(_ s1: String, _ s2: String) -> Int {
        let c1 = Array(s1)
        let c2 = Array(s2)
        var xc = 0
        var yc = 0
        
        for i in 0 ..< c1.count where c1[i] != c2[i] {
            if c1[i] == Character("x") {
                xc += 1
            } else {
                yc += 1
            }
        }
        
        if (xc + yc) % 2 != 0 {
            return -1
        } else {
            return xc / 2 + yc / 2 + 2 * (xc % 2)
        }
    }
}