-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRotate matrix.cpp
More file actions
49 lines (36 loc) · 1.16 KB
/
Rotate matrix.cpp
File metadata and controls
49 lines (36 loc) · 1.16 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
// You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise).
// 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:
// Input: matrix = [[1,2,3],[4,5,6],[7,8,9]]
// Output: [[7,4,1],[8,5,2],[9,6,3]]
// Example 2:
// Input: matrix = [[5,1,9,11],[2,4,8,10],[13,3,6,7],[15,14,12,16]]
// Output: [[15,13,2,5],[14,3,4,1],[12,6,8,9],[16,7,10,11]]
// Example 3:
// Input: matrix = [[1]]
// Output: [[1]]
// Example 4:
// Input: matrix = [[1,2],[3,4]]
// Output: [[3,1],[4,2]]
// Constraints:
// matrix.length == n
// matrix[i].length == n
// 1 <= n <= 20
// -1000 <= matrix[i][j] <= 1000
//Code:
class Solution {
public:
void rotate(vector<vector<int>>& matrix) {
int n = matrix.size();
//taking transverse of matrix
for(int i=0;i<n;i++){
for(int j=0;j<i;j++){
swap(matrix[i][j] , matrix[j][i]);
}
}
// reversing each row in matrix
for(int i=0;i<n;i++){
reverse(matrix[i].begin(),matrix[i].end());
}
}
};