feat: add solutions to lc problem: No.1247.Minimum Swaps to Make Strings Equal

solution/1200-1299/1247.Minimum Swaps to Make Strings Equal/README.md

@@ -70,10 +70,49 @@
 
 ### **Java**
 
-<!-- 这里可写当前语言的特殊实现逻辑 -->
-
 ```java
+class Solution {
+    public int minimumSwap(String s1, String s2) {
+        int xy = 0, yx = 0;
+        char[] c1 = s1.toCharArray();
+        char[] c2 = s2.toCharArray();
+        for (int i = 0; i < c1.length; i++) {
+            if (c1[i] > c2[i]) {
+                xy++;
+            }
+            if (c2[i] > c1[i]) {
+                yx++;
+            }
+        }
+        if ((xy + yx) % 2 != 0) {
+            return -1;
+        }
+        return xy % 2 == 0 ? (xy + yx) / 2 : (xy + yx) / 2 + 1;
+    }
+}
+```
 
+### **Go**
+
+```go
+func minimumSwap(s1 string, s2 string) int {
+	xy, yx := 0, 0
+	for i, _ := range s1 {
+		if s1[i] < s2[i] {
+			xy++
+		}
+		if s1[i] > s2[i] {
+			yx++
+		}
+	}
+	if (xy+yx)%2 != 0 {
+		return -1
+	}
+	if xy%2 == 0 {
+		return (xy + yx) / 2
+	}
+	return (xy+yx)/2 + 1
+}
 ```
 
 ### **...**

solution/1200-1299/1247.Minimum Swaps to Make Strings Equal/README_EN.md

@@ -102,7 +102,48 @@ Note that you can't swap s1[0] and s1[1] to make s1 equal to "yx",
 ### **Java**
 
 ```java
+class Solution {
+    public int minimumSwap(String s1, String s2) {
+        int xy = 0, yx = 0;
+        char[] c1 = s1.toCharArray();
+        char[] c2 = s2.toCharArray();
+        for (int i = 0; i < c1.length; i++) {
+            if (c1[i] > c2[i]) {
+                xy++;
+            }
+            if (c2[i] > c1[i]) {
+                yx++;
+            }
+        }
+        if ((xy + yx) % 2 != 0) {
+            return -1;
+        }
+        return xy % 2 == 0 ? (xy + yx) / 2 : (xy + yx) / 2 + 1;
+    }
+}
+```
 
+### **Go**
+
+```go
+func minimumSwap(s1 string, s2 string) int {
+	xy, yx := 0, 0
+	for i, _ := range s1 {
+		if s1[i] < s2[i] {
+			xy++
+		}
+		if s1[i] > s2[i] {
+			yx++
+		}
+	}
+	if (xy+yx)%2 != 0 {
+		return -1
+	}
+	if xy%2 == 0 {
+		return (xy + yx) / 2
+	}
+	return (xy+yx)/2 + 1
+}
 ```
 
 ### **...**

solution/1200-1299/1247.Minimum Swaps to Make Strings Equal/Solution.go

@@ -0,0 +1,18 @@
+func minimumSwap(s1 string, s2 string) int {
+	xy, yx := 0, 0
+	for i, _ := range s1 {
+		if s1[i] < s2[i] {
+			xy++
+		}
+		if s1[i] > s2[i] {
+			yx++
+		}
+	}
+	if (xy+yx)%2 != 0 {
+		return -1
+	}
+	if xy%2 == 0 {
+		return (xy + yx) / 2
+	}
+	return (xy+yx)/2 + 1
+}

solution/1200-1299/1247.Minimum Swaps to Make Strings Equal/Solution.java

@@ -0,0 +1,19 @@
+class Solution {
+    public int minimumSwap(String s1, String s2) {
+        int xy = 0, yx = 0;
+        char[] c1 = s1.toCharArray();
+        char[] c2 = s2.toCharArray();
+        for (int i = 0; i < c1.length; i++) {
+            if (c1[i] > c2[i]) {
+                xy++;
+            }
+            if (c2[i] > c1[i]) {
+                yx++;
+            }
+        }
+        if ((xy + yx) % 2 != 0) {
+            return -1;
+        }
+        return xy % 2 == 0 ? (xy + yx) / 2 : (xy + yx) / 2 + 1;
+    }
+}