码迷,mamicode.com
首页 > 其他好文 > 详细

54. Spiral Matrix

时间:2017-10-02 17:50:20      阅读:152      评论:0      收藏:0      [点我收藏+]

标签:cout   column   else   should   order   return   while   turn   ret   

Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.

For example,
Given the following matrix:

[
 [ 1, 2, 3 ],
 [ 4, 5, 6 ],
 [ 7, 8, 9 ]
]

You should return [1,2,3,6,9,8,7,4,5].

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        if(matrix.empty())return {};
        vector<int>res;
        int n = matrix.size(), m = matrix[0].size();
        int left = 0, right = m-1, up = 0, down = n-1;
        int index=0;
        while(left < right && up < down){
            for(int i = left; i < right; i++)
                res.push_back(matrix[up][i]);
            for(int i = up; i < down; i++)
                res.push_back(matrix[i][right]);
            for(int i = right; i > left; i--){
                res.push_back(matrix[down][i]);
            }
            for(int i = down; i > up; i--){
                res.push_back(matrix[i][left]);
            }
            left++;right--;up++;down--;
        }
      //  cout<<left<<‘ ‘<<right<<‘ ‘<<up<<‘ ‘<<down<<endl;
        if(left == right)
            for(int i = up; i <= down; i++)res.push_back(matrix[i][left]);
        else if(up == down)
            for(int i = left; i <= right; i++)res.push_back(matrix[up][i]);
        return res;
    }
};

 

54. Spiral Matrix

标签:cout   column   else   should   order   return   while   turn   ret   

原文地址:http://www.cnblogs.com/tsunami-lj/p/7620383.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!