Leetcode Rotate Image

來源:互聯網
上載者:User

標籤:style   blog   color   for   io   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 2 3

4 5 6

7 8 9

順時針旋轉90度為

7 4 1

8 5 2

9 6 3

(i,j)旋轉後變成 (j,n-i-1)

class Solution {public:    void rotate(vector<vector<int> > &matrix) {        int n = matrix.size();        for(int i = 0 ;i  < n/2; ++ i){            for(int j = i; j < n - i-1; ++ j){                swap(matrix[i][j],matrix[j][n-i-1]);                 swap(matrix[i][j],matrix[n-i-1][n-j-1]);                swap(matrix[i][j],matrix[n-j-1][i]);            }        }    }};

 

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.