LeetCode 48: Rotate Image

问题描述

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

第一次的思路是错误的(note中注明要在原来的矩阵中做变换)

在这里插入图片描述
java实现

class Solution {
    public void rotate(int[][] matrix) {
        int row=matrix.length;
        int col=matrix[0].length;

        int [][]temp=new int[col][row];
        for(int j=0;j<col;j++) {
            for (int i = 0; i < row; i++) {
                temp[i][col-1-j] = matrix[j][i];
            }
        }
        for (int i=0;i<row;i++){
            for (int j=0;j<col;j++){
                matrix[i][j]=temp[i][j] ;
            }
        }
    }
}

正确解法

class Solution {
    public void rotate(int[][] matrix) {
        /*1. 先交换行
          2. 再转置
        */
        if(matrix.length<=1) return;
        int n = matrix.length;
        /*  1,2,3
            4,5,6
            7,8,9
        */
        for(int i=0;i<n/2;i++){
            int[] temp = matrix[i];
            matrix[i] = matrix[n-1-i];
            matrix[n-1-i] = temp;
        }
        /*  7,8,9
            4,5,6
            1,2,3
        */
        
        for(int i=0;i<n;i++){
            for(int j=i;j<n;j++){
                int temp =  matrix[j][i];
                matrix[j][i] = matrix[i][j];
                matrix[i][j] = temp;

            }
        }
        /*  7,4,1
            8,5,2
            9,6,3
        */  
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值