题解 | 顺时针旋转矩阵

class Solution {
public:
  //使用辅助数组
     //mat[i][j] -> mat[j][n-i-1]
    vector<vector<int> > rotateMatrix(vector<vector<int> >& mat, int n) {
        vector< vector<int> > ans(mat);

        for(int i=0; i<n; i++){
            for(int j=0; j<n; j++){
                ans[j][n-i-1] = mat[i][j];
            }
        }

        return ans;
    }
};