[Rotate Image48]Rotate Image

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?

Analysis:

This is a classic problem in Craking Coding interview, 1.6

The key idea is to rotate the matrix according to layers. For the nth layer(the out layer), rotate 90 degree is to move all the elements n times in a circle. In each layer, the rotation can be performed by first swap 4 corners, then swap 4 elements next to corner until the end of each line.

While there is another soulution could calculate index easily.

1. lap over along with x-axis2

2. lap over along with diagonal line

Java

public void rotate(int[][] matrix) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int length = matrix.length;
        // swap the diagnoal
        for(int i=0; i<length/2; i++){
        	for(int j=0; j<length; j++){
        		int temp = matrix[i][j];
        		matrix[i][j] = matrix[length-i-1][j];
        		matrix[length-i-1][j] = temp;
        	}
        }
        for(int i=0; i<length; i++){
        	for(int j=0; j<i+1;j++){
        		int temp = matrix[i][j];
        		matrix[i][j] = matrix[j][i];
        		matrix[j][i] = temp;
        	}
        }
    }

c++

void rotate(vector<vector<int> > &matrix) {
        int length = matrix.size();
    for(int i=0;i<length/2;i++){
        for(int j=0;j<length;j++){
            swap(matrix[i][j],matrix[length-1-i][j]);
        }
    }
    for(int i=0;i<length;i++){
        for(int j=0;j<i+1;j++){
            swap(matrix[i][j],matrix[j][i]);
        }
    }
    }


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值