Cover image for Interview Classic 150 Questions P48 Rotate Image

Interview Classic 150 Questions P48 Rotate Image

(Updated: )
algorithm
, , ,
Timeline

timeline

2025-11-17

init

matrix

Title:

P48 Rotate Image

https://leetcode.cn/problems/rotate-image/description/?envType=study-plan-v2&envId=top-interview-150

First flip along the diagonal, then reverse each row.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
#include <vector>
#include <algorithm>
using std::vector;

class Solution {
    public:
	void rotate(vector<vector<int> > &matrix)
	{
		// First flip along the diagonal
		int i, j, n = matrix.size();
		for (i = 0; i < n; i++)
			for(j = i + 1; j< n; j++)
				std::swap(matrix[i][j], matrix[j][i]);

		// Then reverse each row
		for (i = 0; i < n; i++)
			std::reverse(matrix[i].begin(), matrix[i].end());
	}
};

leetcode hot 100 rewrite

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
#include <vector>
#include <algorithm>
using std::vector;

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