leetcode/lcci/01.02.Check Permutation/Solution2.java

9 lines
254 B
Java

class Solution {
public boolean CheckPermutation(String s1, String s2) {
char[] cs1 = s1.toCharArray();
char[] cs2 = s2.toCharArray();
Arrays.sort(cs1);
Arrays.sort(cs2);
return Arrays.equals(cs1, cs2);
}
}