No1247.java

packageAlgorithm.leetcode.String;

/**
 * 
 * Created by tujietg on Nov 4, 2019
 */
publicclassNo1247 {
publicstaticintminimumSwap(Strings1, Strings2) {
inta = 0;
intb = 0;
for (inti = 0; i < s1.length(); i++) {
if (s1.charAt(i) != s2.charAt(i) && s1.charAt(i) == 'x') {
 ++a;
System.out.println(a);
 }
if (s1.charAt(i) != s2.charAt(i) && s1.charAt(i) == 'y') {
 ++b;
System.out.println(b);
 }
 }
if (a % 2 == 0 && b % 2 == 0) {
returna / 2 + b / 2;
 } elseif (a % 2 == 1 && b % 2 == 1) {
returna / 2 + b / 2 + 2;
 } else {
return -1;
 }
 }


}