LeetCode: Rotate Image

最新推荐文章于 2017-06-03 09:19:48 发布

Tingmei

最新推荐文章于 2017-06-03 09:19:48 发布

阅读量1.2k

点赞数

CC 4.0 BY-SA版权

分类专栏： C++ 算法

本文链接：https://blog.youkuaiyun.com/Tingmei/article/details/8046510

算法同时被 2 个专栏收录

109 篇文章

订阅专栏

C++

108 篇文章

订阅专栏

本文介绍了一个C++实现的算法，该算法能够将一个n×n的二维矩阵按顺时针方向旋转90度。该算法采用原地旋转的方式，通过多层循环交换矩阵元素来完成旋转任务。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

You are given an n x n 2D matrix representing an image.

Rotate the image by 90 degrees (clockwise).

Follow up:
Could you do this in-place?

class Solution {
public:
    void rotate(vector<vector<int> > &matrix) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int height = matrix.size();
        if (height == 0) return;
        int width = matrix[0].size();
        assert(height == width);
        
        for (int layer = 0; layer < height/2; ++layer)
        {
            int first = layer;
            int last = height - 1 - layer;
            for (int i = first; i < last; ++i)
            {
                int offset = i - first;
                int top = matrix[first][i];
                // left -> top
                matrix[first][i] = matrix[last-offset][first];
                // bottom -> left
                matrix[last-offset][first] = matrix[last][last-offset];
                // right -> bottom
                matrix[last][last-offset] = matrix[i][last];
                matrix[i][last] = top;
            }
        }
    }
};