CRCK 1.6 (Easy can be extened to Hard)

最新推荐文章于 2024-09-04 23:52:41 发布

ActiveCoder

最新推荐文章于 2024-09-04 23:52:41 发布

阅读量326

点赞数

分类专栏： Cracking Code

本文链接：https://blog.csdn.net/github_34333284/article/details/51002597

版权

Cracking Code 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

Given an image represented by an NxN matrix, where each pixel in the image is 4 bytes, write a method to rotate the image by 90 degrees. Can you do this in palace?

(This problem is in Easy Level)

Example:

1 2 3 7 4 1

4 5 6 ---> 8 5 2

7 8 9 9 6 3 (result matrix)

In order to do that, we need to first swap elements to the diagonal.

1 2 3 1 2 3' 9 6 3 7 4 1

4 5 6 ---> 4 5' 6 --> 8 5 2 --> swap elements to the middle 8 5 2

7 8 9 7' 8 9 7 4 1 9 6 3 (result matrix)

// Transform NxN matrix

void transformMatrix(vector< vector<int> >& matrix) {

    // base conditions

    if(matrix.size() == 0) return;

    if(matrix[0].size() == 0) return;

    // if it is not NxN matrix, we can't use this method.

    if(matrix.size() != matrix[0].size()) return;

    int size = matrix.size();

    // swap elements diagonally.

    for(int i = 0; i < size; ++i) {

        for(int j = 0; j + i < size; ++j ) {

              swap(matrix[i][j], matrix[size - 1 - j][size - 1 - i]);

        }

    }

    // swap elements to the middle.

   for(int i = 0; i < size / 2; ++i) {

       for(int j = 0; j < size; ++j) {

            swap(matrix[i][j], matrix[size - 1 - x][j]);

       }

   }

}

To extend into Hard Level: The matrix is MxN.