题目
class Solution {
public:
int dis[4][2]={{0,1},{1,0},{0,-1},{-1,-0}};
map<int,int>vis;int n,m;
int isok(int i,int j){
return i>=0&&i<n&&j>=0&&j<m&&!vis[i*m+j];
}
vector<int> spiralOrder(vector<vector<int>>& ma) {
vector<int>ans;
n=ma.size(),m=ma[0].size();
int i=0,j=0,k=0;
while(1){
if(!isok(i,j)) break;
ans.push_back(ma[i][j]);
vis[i*m+j]=1;
if(!isok(i+dis[k][0],j+dis[k][1])){
k=(++k)%4;
}
i+=dis[k][0],j+=dis[k][1];
}
return ans;
}
};
class Solution {
public:
vector<int> spiralOrder(vector<vector<int>>& ma) {
if(!ma.size()||!ma[0].size()) return {};
int n=ma.size(),m=ma[0].size();
vector<int>ans;
int l=0,r=m-1,up=0,down=n-1;
while(l<=r&&up<=down){
for(int k=l;k<=r;++k) ans.push_back(ma[up][k]);
for(int k=up+1;k<=down;++k) ans.push_back(ma[k][r]);
if(l<r&&up<down){
for(int k=r-1;k>=l;--k) ans.push_back(ma[down][k]);
for(int k=down-1;k>=up+1;--k) ans.push_back(ma[k][l]);
}
++l,--r,++up,--down;
}
return ans;
}
};