[LeetCode] 48. Rotate Image

Warren 发布于2019-08-16 13:58 / 2755人阅读

Problem

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

Solution Transpose + Flip horizontally

class Solution {
    public void rotate(int[][] matrix) {
        int n = matrix.length;
        for (int i = 0; i < n; i++) {
            for (int j = i; j < n; j++) {
                int temp = matrix[i][j];
                matrix[i][j] = matrix[j][i];
                matrix[j][i] = temp;
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n/2; j++) {
                int temp = matrix[i][j];
                matrix[i][j] = matrix[i][n-1-j];
                matrix[i][n-1-j] = temp;
            }
        }
    }
}

4-way swap

class Solution {
    public void rotate(int[][] matrix) {
        int n = matrix.length;
        for (int i = 0; i < n/2; i++) {
            for (int j = i; j < n-i-1; j++) {
                swap(matrix, n, i, j);
            }
        }
    }
    private void swap(int[][] matrix, int n, int i, int j) {
        int temp = matrix[i][j];
        matrix[i][j] = matrix[n-1-j][i];
        matrix[n-1-j][i] = matrix[n-1-i][n-1-j];
        matrix[n-1-i][n-1-j] = matrix[j][n-1-i];
        matrix[j][n-1-i] = temp;
    }
}

GPU云服务器云服务器 Rotate 旋转-rotate LeetCode LeetCode_String

文章版权归作者所有，未经允许请勿转载,若此文章存在违规行为，您可以联系管理员删除。

转载请注明本文地址：https://www.ucloud.cn/yun/72651.html

LeetCode[48] Rotate Image

LeetCode[48] 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? 复杂度O(N^2),O(1) 代码 public void ro...

sanyang 2019-08-14 15:07 评论0 收藏0
leetcode 48 Rotate Image

摘要：题目详情这道题目要求我们对一个正方形矩阵进行顺时针度的翻转。并且要求不声明额外的空间，不能新建二维数组。输入数组旋转后的输入数组想法这道题因为要求在位。所以我们需要找到一种解法，使得每次操作都是交换两个元素的位置，最后实现整个矩阵的旋转。题目详情 You are given an n x n 2D matrix representing an image.Rotate the ima...

kgbook 2019-08-15 14:17 评论0 收藏0
leetcode48 Rotate Image 90度旋转数组

摘要：每一次的旋转，其实都是正方形上的四个元素之间的相互替换。所以本质上我们只需遍历每种长度正方形上的一条边，就可以完成这个正方形的旋转。最后实现整个数组矩阵的旋转代表正方形的起始位置，即，，即，代表当前正方形上的一条边上的一个点。题目要求 You are given an n x n 2D matrix representing an image. Rotate the image b...

melody_lql 2019-08-16 10:34 评论0 收藏0
leetcode 部分解答索引（持续更新～）

摘要：前言从开始写相关的博客到现在也蛮多篇了。而且当时也没有按顺序写现在翻起来觉得蛮乱的。可能大家看着也非常不方便。所以在这里做个索引嘻嘻。顺序整理更新更新更新更新更新更新更新更新更新更新更新更新更新更新更新更新前言从开始写leetcode相关的博客到现在也蛮多篇了。而且当时也没有按顺序写～现在翻起来觉得蛮乱的。可能大家看着也非常不方便。所以在这里做个索引嘻嘻。顺序整理 1~50 1...

leo108 2019-08-15 14:26 评论0 收藏0
[Leetcode] Rotate Image 旋转图片

摘要：交换法复杂度时间空间思路为了实现这题，我们要用交换的方法，顺序是左上先和左下交换，然后左上和右下交换，然后左上和右上交换。和类似，我们通过圈数来控制内外的顺序。代码计算圈数左上和左下交换左上和右下交换左上和右上交换 Rotate Image You are given an n x n 2D matrix representing an image. Rotate the image...

Brenner 2019-08-14 12:41 评论0 收藏0