leetcode--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?

public class Solution {
    /**The algorithm is simple.
     * @author Averill Zheng
     * @version 2014-06-15
     * @since JDK 1.7
     */
    public void rotate(int[][] matrix) {
        int length = matrix.length;
		for(int i = 0; i < length / 2; ++i){
			for(int k = i; k < length - 1 - i; ++k){
				matrix[i][k] += (matrix[k][length - 1 - i] + matrix[length - 1 - i][length - 1 - k] 
								 + matrix[length - 1 - k][i]);
				matrix[k][length - 1 - i] = (matrix[i][k] - matrix[k][length - 1 - i] 
											 - matrix[length - 1 - i][length - 1 - k] 
											 - matrix[length - 1 - k][i]);
				matrix[length - 1 - i][length - 1 - k] = (matrix[i][k] - matrix[k][length - 1 - i] 
						 								  - matrix[length - 1 - i][length - 1 - k] 
						 								  - matrix[length - 1 - k][i]);
				matrix[length - 1 - k][i] = (matrix[i][k] - matrix[k][length - 1 - i] 
						   					 - matrix[length - 1 - i][length - 1 - k] 
						   					 - matrix[length - 1 - k][i]);
				matrix[i][k] = (matrix[i][k] - matrix[k][length - 1 - i] 
						        - matrix[length - 1 - i][length - 1 - k] 
						        - matrix[length - 1 - k][i]);
			}
		}    
    }
}

  

转载于:https://www.cnblogs.com/averillzheng/p/3790273.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值