LeetCode之Spiral Matrix

来源:互联网 发布:java 串口封装类 编辑:程序博客网 时间:2024/03/29 20:49

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

#include <vector>class Solution {public:vector<int> spiralOrder(vector<vector<int>> &matrix) {vector<int> result;if (matrix.size() == 0) return result;int rowB = 0, rowE = matrix.size()-1;int columnB = 0, columnE = matrix[0].size()-1;while(true){//left->rightfor (int i = columnB; i <= columnE; i++)result.push_back(matrix[rowB][i]);if (++rowB > rowE)break;//top->bottomfor (int i = rowB; i <= rowE; i++)result.push_back(matrix[i][columnE]);if (--columnE < columnB)break;//right->leftfor (int i = columnE; i >= columnB; i--)result.push_back(matrix[rowE][i]);if (--rowE < rowB)break;//bottom->topfor (int i = rowE; i >= rowB; i--)result.push_back(matrix[i][columnB]);if (++columnB > columnE)break;}//whilereturn result;}};



1 0