题解 | #牧场重组计划#

class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param matrix int整型vector<vector<>> 
     * @return int整型vector<vector<>>
     */
    vector<vector<int> > rotatePastureCounterClockwise(vector<vector<int> >& matrix) {
        // write code here
        int row = matrix.size(), col = matrix[0].size();
        for (int i = 0; i < row; i++) {
            for (int j = i+1; j < col; j++) {
                swap(matrix[i][j], matrix[j][i]);
            }
        }
        for (int i = 0; i < row/2; i++) {
            for (int j = 0; j < col; j++) {
                swap(matrix[i][j], matrix[row-i-1][j]);
            }
        }
        return matrix;
    }
};