LandscapeMi

landscapemi的博客

leetcode_c++:Spiral Matrix(054)

题目

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].


算法

复杂度:O(nm)


class Solution{
public:
    vector<int> spiralOrder(vector<vector<int> > &matrix){
        vector<int> result;
        if(matrix.empty()) 
            return result;
        int beginX=0,endX=matrix[0].size()-1;
        int beginY=0,endY=matrix.size()-1;

        while(true){
            //from left to right
            for(int i=beginX;i<=endX;++i)
                result.push_back(matrix[beginY][i]);
            if(++beginY>endY)  break;

            //from top to down
            for(int i=beginY;i<=endY;++i)
                result.push_back(matrix[i][endX]);
            if(beginX>--endX)  break;

            //form right to left
            for(int i=endX;i>=beginX;--i)
                result.push_back(matrix[endY][i]);
            if(beginY>--endY)  break;

            //form bottom to up
            for(int i=endY;i>=beginY;--i)
                result.push_back(matrix[i][beginX]);
            if(++beginX>endX) break;

        }

        return result;

    }
};
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/mijian1207mijian/article/details/51542192
个人分类: leetcode(c++)
上一篇机器学习:主题模型:LSA
下一篇leetcode_c++: Jump Game(055)
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭