算法分析与设计课程——LeetCode刷题之 Rotate Image
2018-01-11 22:07
567 查看
题目:
You are given an n x n 2D matrix representing an image.
Rotate the image by 90 degrees (clockwise).
Note:
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:
Example 2:
答案:
public class Solution {
public void rotate(int[][] matrix) {
for(int i = 0; i<matrix.length; i++){
for(int j = i; j<matrix[0].length; j++){
int temp = 0;
temp = matrix[i][j];
matrix[i][j] = matrix[j][i];
matrix[j][i] = temp;
}
}
for(int i =0 ; i<matrix.length; i++){
for(int j = 0; j<matrix.length/2; j++){
int temp = 0;
temp = matrix[i][j];
matrix[i][j] = matrix[i][matrix.length-1-j];
matrix[i][matrix.length-1-j] = temp;
}
}
}
}
You are given an n x n 2D matrix representing an image.
Rotate the image by 90 degrees (clockwise).
Note:
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:
Given input matrix = [ [1,2,3], [4,5,6], [7,8,9] ], rotate the input matrix in-place such that it becomes: [ [7,4,1], [8,5,2], [9,6,3] ]
Example 2:
Given input matrix = [ [ 5, 1, 9,11], [ 2, 4, 8,10], [13, 3, 6, 7], [15,14,12,16] ], rotate the input matrix in-place such that it becomes: [ [15,13, 2, 5], [14, 3, 4, 1], [12, 6, 8, 9], [16, 7,10,11] ]
答案:
public class Solution {
public void rotate(int[][] matrix) {
for(int i = 0; i<matrix.length; i++){
for(int j = i; j<matrix[0].length; j++){
int temp = 0;
temp = matrix[i][j];
matrix[i][j] = matrix[j][i];
matrix[j][i] = temp;
}
}
for(int i =0 ; i<matrix.length; i++){
for(int j = 0; j<matrix.length/2; j++){
int temp = 0;
temp = matrix[i][j];
matrix[i][j] = matrix[i][matrix.length-1-j];
matrix[i][matrix.length-1-j] = temp;
}
}
}
}
相关文章推荐
- 算法分析与设计课程(10):【leetcode】Simplify Path
- 算法分析与设计课程(18):【leetcode】Clone Graph
- 算法分析与设计课程——LeetCode刷题之 Spiral Matrix
- 算法分析与设计课程(6):【leetcode】Sudoku
- 算法分析与设计课程(19):【leetcode】Ugly Number II
- 算法分析与设计课程(16):【leetcode】 Integer to Roman
- 算法分析与设计课程(7):【leetcode】Reverse Nodes in k-Group
- 算法分析与设计课程(11):【leetcode】Gray Code
- 算法分析与设计课程(12):【leetcode】 Count Complete Tree Nodes
- 算法分析与设计课程(15):【leetcode】 Find Minimum in Rotated Sorted Array
- 算法分析与设计课程——LeetCode刷题之Reverse Integer
- 算法分析与设计课程(5):【leetcode】Search for a Range
- 算法分析与设计课程(14):【leetcode】 Maximal Square
- 算法分析与设计课程——LeetCode刷题之Valid Parentheses
- 算法分析与设计课程(3):【leetcode】Permutations
- 算法分析与设计课程——LeetCode刷题之 Pow(x, n)
- 算法分析与设计课程——LeetCode刷题之3Sum
- 算法分析与设计课程(17):【leetcode】4Sum
- 算法分析与设计课程(4):【leetcode】Wildcard Matching
- 算法分析与设计课程——LeetCode刷题之Remove Duplicates from Sorted Array