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

    思路:

    1) 把matrix想象成四块,把第一块抠出来并copy一份,然后旋转式copy,代码较长。

    package rotation;
    
    public class RotateImage {
    
        public void rotate(int[][] matrix) {
            int n = matrix.length;
            int rows = n / 2;
            int cols = n % 2 == 0 ? rows : (rows + 1);
            int[][] tmp = new int[rows][cols];
            for (int i = 0; i < rows; ++i) {
                for (int j = 0; j < cols; ++j) {
                    tmp[i][j] = matrix[i][j];
                }
            }
            
            for (int i = rows; i < n; ++i) {
                for (int j = 0; j < cols; ++j) {
                    matrix[j][n - 1 - i] = matrix[i][j];
                }
            }
            
            for (int i = cols; i < n; ++i) {
                for (int j = rows; j < n; ++j) {
                    matrix[j][n - 1 - i] = matrix[i][j];
                }
            }
            
            for (int i = 0; i < cols; ++i) {
                for (int j = cols; j < n; ++j) {
                    matrix[j][n - 1 - i] = matrix[i][j];
                }
            }
            
            for (int i = 0; i < rows; ++i) {
                for (int j = 0; j < cols; ++j) {
                    matrix[j][n - 1 - i] = tmp[i][j];
                }
            }
        }
        
        public static void main(String[] args) {
            // TODO Auto-generated method stub
            // int[][] matrix = {{1,2,3},{5,6,7},{9,10,11}};
            int[][] matrix = {{1,2},{3,4}};
            RotateImage r = new RotateImage();
            r.rotate(matrix);
        }
    
    }

    2) 其实可以将上面的代码进行简化合并,如下

    package rotation;
    
    public class RotateImage {
    
        public void rotate(int[][] matrix) {
            int n = matrix.length;
            int rows = n / 2;
            int cols = n - rows;
            for (int i = 0; i < rows; ++i) {
                for (int j = 0; j < cols; ++j) {
                    int tmp = 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] = tmp;
                }
            }
        }
        
        public static void main(String[] args) {
            // TODO Auto-generated method stub
            // int[][] matrix = {{1,2,3},{5,6,7},{9,10,11}};
            int[][] matrix = {{1,2},{3,4}};
            RotateImage r = new RotateImage();
            r.rotate(matrix);
        }
    
    }
  • 相关阅读:
    叶落归根(hometown)
    设置(settings)
    文明距离(civil)
    计算机基础知识
    gojs插件使用教程
    编程语言分类
    dp优化简单总结
    Splay入门题目 [HNOI2002]营业额统计
    hdu3415:最大k子段和,单调队列
    hdu5072(鞍山regional problem C):容斥,同色三角形模型
  • 原文地址:https://www.cnblogs.com/null00/p/5076029.html
Copyright © 2011-2022 走看看