【Leetcode Summary】旋转图像

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 NOTallocate 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]
]

solution:就是直接按照矩阵对角线翻转一次,然后再按照X轴中线上下翻转一次,代码如下:


void rotate(int** matrix, int matrixRowSize, int matrixColSize) {
    int i,j;
    int tmp;
 
    for (i=0;i<matrixRowSize-1;i++) {
    	for (j=0;j<matrixColSize-i;j++) {
            tmp=matrix[i][j];
        matrix[i][j]=matrix[matrixColSize - 1- j][matrixRowSize - 1 - i];
        matrix[matrixColSize - 1- j][matrixRowSize - 1 - i]= tmp;   
 
    	}
    }
    
     for (i=0;i<matrixRowSize/2;i++) {
    	for (j=0;j<matrixColSize;j++) {
            tmp=matrix[i][j];
        matrix[i][j]=matrix[matrixRowSize - 1 - i][j];
        matrix[matrixRowSize - 1 - i][j]= tmp;   
 
    	}
    }
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值