面试题 01.07. 旋转矩阵

链接：https://leetcode-cn.com/problems/rotate-matrix-lcci/

题解：https://leetcode-cn.com/problems/rotate-matrix-lcci/solution/xuan-zhuan-ju-zhen-by-leetcode-solution/

class Solution {
    public:
    void rotate(vector<vector<int>>& matrix) {
        int len = matrix.size()/2;
        for(int i = 0; i < len/2; ++i) {
            for(int j = 0; j < (len+1)/2; ++j) {
                int temp = matrix[i][j];
                matrix[i][j] = matrix[len-j-1][i];
                matrix[len-j-1][i] = matrix[len-i-1][len-j-1];
                matrix[len-i-1][len-j-1] = matrix[j][len-i-1];
                matrix[j][len-i-1] = temp;
            }
        }
    }
};