48. Rotate Image (Graph)

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?

class Solution {
public:
    void rotate(vector<vector<int> > &matrix) {
        int temp;
        for(int i = 0; i < matrix.size()/2; i++)
        {
            for(int j = i; j < matrix[0].size()-i-1; j++)
            {
                temp = matrix[i][j];
                matrix[i][j] = matrix[matrix[0].size()-1-j][i];
                matrix[matrix[0].size()-1-j][i] = matrix[matrix.size()-1-i][matrix.size()-1-j];
                matrix[matrix.size()-1-i][matrix.size()-1-j] =  matrix[j][matrix.size()-1-i];
                matrix[j][matrix.size()-1-i] = temp;
            }
        }
    }
};
时间: 2024-10-10 00:11:19

48. Rotate Image (Graph)的相关文章

48. Rotate Image(js)

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

48.Rotate Image

You are given an n x n 2D matrixrepresenting an image. Rotate the image by 90 degrees (clockwise). Follow up: Could you do this in-place? HideTags Array #pragma once #include<iostream> #include<vector> using namespace std; //[i,j]->[j,n-i]-

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? 思路:把矩阵看成是由多个正方形一层一层包围起来的.转动的时候就是转动正方形的边,只要把边上的每个数依次替换就好,四个方向也就是进行四次替换,依次对每一层进行替换. 总层数 = matrix.length/2,第i层从第mat

LeetCode 48. Rotate Image My Submissions Question (矩阵旋转)

题目大意:给一个矩阵,将其按顺时针旋转90°. 题目分析:通法是先将矩阵转置,然后再反转每一行,或者是先反转每一列,然后再将其转置.I just want to say"It's amazing!".(forgivig my poor English!) 代码如下(代码怎么写已经不重要了!): class Solution { public: void rotate(vector<vector<int>>& matrix) { int r=matrix.

48. Rotate Image java solutions

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? 题目大意是将矩阵做就地顺时针90度旋转. 1 public class Solution { 2 public void rotate(int[][] matrix) { 3 int n = matrix.length; 4

&lt;LeetCode OJ&gt; 48. Rotate Image

Total Accepted: 69879 Total Submissions: 199786 Difficulty: Medium 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? Subscribe to see which companies asked this

[leedcode 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? In order to fulfill the follow up requirement,  i.e. in-place, we should utilize a temporary int variable and sw

【一天一道LeetCode】#48. Rotate Image

一天一道LeetCode系列 (一)题目 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? (二)解题 90度旋转图像,我们不难看出 matrix[i][j]=tmp[j][n?i?1]注:tmp=matrix 经过这样的变换后,图像就旋转了90度. class Solu

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? 题目标签:Array 这道题目给了我们一个n * n的矩阵,让我们旋转图片.题目要求in-place,所以就不能用额外的空间了.一开始自己写了一个很原始的方法,结果虽然通过,但是速度太慢.只好去看看别人的方法,看完觉得,自己