48. Rotate Image

最新推荐文章于 2020-12-15 21:08:52 发布

是三水不是泗水

最新推荐文章于 2020-12-15 21:08:52 发布

阅读量120

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/csg3140100993/article/details/102893194

版权

LeetCode 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

48. Rotate Image

Medium

2022179FavoriteShare

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

Rotate the image by 90 degrees (clockwise).

Note:

You have to rotate the image in-place, which means you have to modify the input 2D matrix directly. DO NOT allocate another 2D matrix and do the rotation.

Example 1:

Given input matrix = 
[
  [1,2,3],
  [4,5,6],
  [7,8,9]
],

rotate the input matrix in-place such that it becomes:
[
  [7,4,1],
  [8,5,2],
  [9,6,3]
]

Example 2:

Given input matrix =
[
  [ 5, 1, 9,11],
  [ 2, 4, 8,10],
  [13, 3, 6, 7],
  [15,14,12,16]
], 

rotate the input matrix in-place such that it becomes:
[
  [15,13, 2, 5],
  [14, 3, 4, 1],
  [12, 6, 8, 9],
  [16, 7,10,11]
]

Accepted

305,296

Submissions

593,358

class Solution {
public:
    void rotate(vector<vector<int>>& matrix) {
        if(matrix.size()==0) return;
        int n=matrix[0].size();
        for(int i=0;i<n;i++){
        	for(int j=i;j<n;j++){//这里从i开始，防止重复翻转回到原来的矩阵
        		//swap(matrix[i][j],matrix[j][i]);
                int temp=matrix[i][j];
                matrix[i][j]=matrix[j][i];
                matrix[j][i]=temp;
        	}
        }
        for(int i=0;i<n;i++){
        	for(int j=0;j<n/2;j++){
        		//swap(matrix[i][j],matrix[i][n-j-1]);
                int temp=matrix[i][j];
                matrix[i][j]=matrix[i][n-j-1];
                matrix[i][n-j-1]=temp;
        	}
        }
        
    }
};