zoukankan      html  css  js  c++  java
  • 18 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]
    ]

    本题的技巧在于先将矩阵的行进行交换,底行换顶行,再交换对称位置的元素就可以得到旋转90°的矩阵

    class Solution {
    public:
        void rotate(vector<vector<int>>& matrix) {
            
            // first row -> last column
            // ith row, (n-i)th column
            
            //compute transpose matrix!!!
            int n = matrix.size();
            
            vector<int> temp;
            
            //swap the rows 
            for(int i=0;i<n/2;i++)
            {
                temp = matrix[i];
                matrix[i]   = matrix[n-i-1];
                matrix[n-i-1] = temp; 
            }
            
            //exchange positions
            int val;
            for(int i=0; i<n;i++)
            {
                for(int j=i+1;j<n;j++)
                {
                    val = matrix[i][j];
                    matrix[i][j] = matrix[j][i];
                    matrix[j][i] = val;
                }
                
                    
            }
        }
    };
    
  • 相关阅读:
    day_07 深浅拷贝
    day_06 再谈编码
    day_05 字典
    day_04 列表
    day_03 字符串
    HDU 1049 Climbing Worm
    HDU 1720 A+B Coming
    Pascal向C++的跨越
    B-Boxes
    喵哈哈村的狼人杀大战(4)
  • 原文地址:https://www.cnblogs.com/xiaoyisun06/p/11386041.html
Copyright © 2011-2022 走看看