leetcode：面试题 01.02. 判定是否互为字符重排

题目来源

LETTCODE

题目描述

没有说一定是英文字符

题目分析

两个数各个字母出现的频率是否一样

c++

bool CheckPermutation(string s1, string s2) {
    sort(s1.begin(), s1.end());
    sort(s2.begin(), s2.end());
    
    return s1 == s2;
}

java

     public static boolean CheckPermutation(String s1, String s2) {
        if (s1.length() != s2.length()){
            return false;
        }

        char[] c1 = s1.toCharArray();
        char[] c2 = s2.toCharArray();

        Arrays.sort(c1);
        Arrays.sort(c2);

        boolean flag = true;
        for (int i = 0; i < c1.length; i++){
           if (c1[i] != c2[i]){
               flag = false;
               break;
           }
        }



        return flag;
     }