LeetCode | 48. Rotate Image矩阵翻转

Youare given an n x n 2D matrix representing an image.

Rotatethe image by 90 degrees (clockwise).

Note:
You have to rotate the image
 in-place, which means you have to modify theinput 2D matrix directly. DONOT allocate another 2D matrix and do therotation.

Example1:

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]

]

Example2:

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]

]

这题给你一个矩阵,要求你把它顺时针翻转90度

 

 

 

 

翻转之前的数假如在(i,j)的位置,那么翻转之后他在(j,c-1-i)的位置,c为矩阵的列数

void rotate(vector<vector<int>>& matrix) {
	int r = matrix.size();
	int c = matrix[0].size();
	vector<vector<int>> temp(r, vector<int>(c, 0));
	for(int i=0;i<r;i++)
		for (int j = 0; j < c; j++)
		{
			temp[j][c - 1 - i] = matrix[i][j];
		}
	matrix = temp;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值