[LeetCode]Spiral Matrix I & II & Rotate Matrix

矩阵神马的最讨厌了！！转的我头疼！明天待我刷完rotation和旋转矩阵一放在一起

Rotate Matrix

You are given an n x n 2D matrix representing an image.

Rotate the image by 90 degrees (clockwise).

从最外层开始一层一层剥掉

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-1-i; j++) { int temp = matrix[i][j]; matrix[i][j] = matrix[n-1-j][i]; matrix[n-1-j][i] = matrix[n-1-i][n-1-j]; matrix[n-1-i][n-1-j] = matrix[j][n-1-i]; matrix[j][n-1-i] = temp; } } return; } }; </int>

Spiral Matrix I

先做了2 看了答案觉得网上答案思路比我清晰一些 然后用他的方法做了1. II的答案搞了两个数 分别记住第一行和最后一行的位置。每绕一圈指针分别加1减1.类似的，spiral matrix I可以搞四个数记住每一圈四个顶点的位置。每绕一圈四个数往里面缩一圈。如果是奇数行/列需要特别考虑一下最中间的那一行/列

class Solution { public: vector<int> spiralOrder(vector<vector<int> > &matrix) { vector<int> result; int m =matrix.size(); if(m == 0) return result; int n = matrix[0].size(); int a1 = 0,b1 = 0,a2 = m-1, b2 =n-1; while(a1<a2 && b1<b2) { for(int i = b1; i <b2;i++) { result.push_back(matrix[a1][i]); } for(int i = a1; i <a2 i="" result="" push_back="" matrix="" i="" b2="" for="" int="" i="b2;i"> b1;i--) { result.push_back(matrix[a2][i]); } for(int i = a2;i>a1;i--) { result.push_back(matrix[i][b1]); } a1++;b1++;a2--;b2--; } if(a1 == a2 && b1!=b2) for(int i = a1; i <= b2;i++) { result.push_back(matrix[a1][i]); } else if(b1 == b2 && a1 != a2) for(int i = b1;i<=a2;i++) { result.push_back(matrix[i][b1]); } else if(b1 == b2 && a1 == a2) result.push_back(matrix[a1][b1]); return result; } }; </a2></int></int></int>

Spiral Matrix II

Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.

class Solution { public: vector<vector<int> > generateMatrix(int n) { vector<vector<int>> result; if(n<=0) return result; result.resize(n); for(int i = 0; i < n;i++) result[i].resize(n); int m = 0; int k = 1; while(m < (n-1)/2+1) { int j = m; int i = m; for(j = m; j < n-m-1; j++) { result[m][j] = k++; } for(i = m;i < n-m-1;i++) { result[i][n-m-1] = k++; } for(j = n-m-1;j>m;j--) { result[n-m-1][j] = k++; } for(i = n-m-1;i>m;i--) { result[i][m] = k++; } if(m*2+1-n == 0)result[m][m] = k++; m++; } return result; } }; </int></int>