给定两个字符串，请编写程序，确定其中一个字符串的字符重新排列后，能否变成另一个字符串。这里规定大小写为不同字符，且考虑字符串重点空格。 给定一个string stringA和一个string stri

**给定两个字符串，请编写程序，确定其中一个字符串的字符重新排列后，能否变成另一个字符串。这里规定大小写为不同字符，且考虑字符串重点空格。
给定一个string stringA和一个string stringB，请返回一个bool，代表两串是否重新排列后可相同。保证两串的长度都小于等于5000。
测试样例：
“This is nowcoder”,”is This nowcoder”
返回：true
“Here you are”,”Are you here”
返回：false**

package Question1_3;

public class Question { 
    public static String sort(String s) {
        char[] content = s.toCharArray();
        java.util.Arrays.sort(content);
        return new String(content);
    }

    public static boolean permutation(String s, String t) {
        return sort(s).equals(sort(t));
    }

    public static boolean anagram(String s, String t) {
        if (s.length() != t.length())
            return false;
        int[] letters = new int[128];
        int num_unique_chars = 0;
        int num_completed_t = 0;
        char[] s_array = s.toCharArray();
        for (char c : s_array) { // count number of each char in s.
            if (letters[c] == 0)
                ++num_unique_chars;
            ++letters[c];
        }
        for (int i = 0; i < t.length(); ++i) {
            int c = (int) t.charAt(i);
            if (letters[c] == 0) { // Found more of char c in t than in s.
                return false;
            }
            --letters[c];
            if (letters[c] == 0) {
                ++num_completed_t;
                if (num_completed_t == num_unique_chars) {
                    // it誷 a match if t has been processed completely
                    return true;
                    //return i == t.length() - 1;
                }
            }
        }
        return false;
    }   

    public static void main(String[] args) {
        String[][] pairs = {{"apple", "papel"}, {"carrot", "tarroc"}, {"hello", "llloh"}};
        for (String[] pair : pairs) {
            String word1 = pair[0];
            String word2 = pair[1];
            boolean anagram = permutation(word1, word2);
            System.out.println(word1 + ", " + word2 + ": " + anagram);
            System.out.println(anagram(word1, word2));
        }
    }
}

package Question1_3;

public class QuestionB {
public static boolean permutation(String s, String t) {
if (s.length() != t.length()) {
return false;
}

    int[] letters = new int[128];

    char[] s_array = s.toCharArray();
    for (char c : s_array) { // count number of each char in s.
        letters[c]++;  
    }

    for (int i = 0; i < t.length(); i++) {
        int c = (int) t.charAt(i);
        if (--letters[c] < 0) {
            return false;
        }
    }

    return true;
}

public static void main(String[] args) {
    String[][] pairs = {{"apple", "papel"}, {"carrot", "tarroc"}, {"hello", "llloh"}};
    for (String[] pair : pairs) {
        String word1 = pair[0];
        String word2 = pair[1];
        boolean anagram = permutation(word1, word2);
        System.out.println(word1 + ", " + word2 + ": " + anagram);
    }
}

}