本文共 676 字,大约阅读时间需要 2 分钟。
#includeusing namespace std;class Solution {public: vector printMatrix(vector > matrix) { if(matrix.size()<=0) return *(new vector ); // right , down, left , up; const int dirX[] = {0,1,0,-1}; const int dirY[] = {1,0,-1,0}; int X = matrix.size() ; int Y = matrix[0].size(); int locX = 0; int locY = -1; vector ans; while(X>0 && Y>0){ X--; //left to right; for(int i=0;i
转载地址:http://wfwji.baihongyu.com/