力扣 面试题 01. 02、07

排序比较就行，学到了Arrays.equals（）可以比较两个数组的值是否相同

class Solution {
    public boolean CheckPermutation(String s1, String s2) {
        if(s1.length() != s2.length())
            return false;
        char[] c1 = s1.toCharArray(), c2 = s2.toCharArray();
        Arrays.sort(c1);
        Arrays.sort(c2);
        //Arrays.equals(c1,c2);
        for(int i = 0; i < c1.length; i++)
            if(c1[i] != c2[i])
                return false;
        return true;
    }
}

数学题，先上下翻转，再右上与左下翻转

class Solution {
    public void rotate(int[][] matrix) {
        int n = matrix.length;
        for(int i = 0; i < n/2; i++){
            for(int j = 0; j < n; j++){
                matrix[i][j] ^= matrix[n - 1 - i][j];
                matrix[n - 1 - i][j] ^= matrix[i][j];
                matrix[i][j] ^= matrix[n - 1 - i][j];
            }
        }
        for(int i = 0; i < n; i++){
            for(int j = i + 1; j < n; j++){
                matrix[i][j] ^= matrix[j][i];
                matrix[j][i] ^= matrix[i][j];
                matrix[i][j] ^= matrix[j][i];
            }
        }
    }
}