leetcode Spiral Matrix

代码：

#include<iostream>
#include<vector>

using namespace std;

vector<int> spiralOrder(vector<vector<int>>& matrix)
{
    if (matrix.size() == 0)
        return vector<int>();
    vector<int> result;
    int m = matrix.size();
    int n = matrix[0].size();
    int total = m*n;
    int t = 1;
    int k = 0;
    while (1)
    {
        int i = k;
        int j = k;
        while (j < n - k)
            result.push_back(matrix[i][j++]);
        j--;
        i++;
        if (result.size() == total)
            return result;
        while (i < m - k)
            result.push_back(matrix[i++][j]);
        i--;
        j--;
        if (result.size() == total)
            return result;
        while (j>=k)
            result.push_back(matrix[i][j--]);
        j++;
        i--;
        while (i>k)
            result.push_back(matrix[i--][j]);
        if (result.size() == total)
            return result;
        k++;    
    }
}

int main()
{
    vector<vector<int>> matrix = 
    {
        {1,2,3},
        {4,5,6},
        {7,8,9}
    };
    vector<int> a = spiralOrder(matrix);
    for (int i = 0; i < a.size(); i++)
        cout << a[i] << "    ";
    cout << endl;
    return 0;
}