leetcode54

leetcode 54

题目：给你一个m行n列的矩阵matrix，请按照顺时针螺旋顺序，返回矩阵中的所有元素。

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        int length = matrix[0].size();
        int high = matrix.size();
        vector<int> r(high * length, 0);
        int circle = (high > length ? length : high) / 2;
        int start = 0;
        int l = length;
        int h = high;
        int sn = 0;
        while (circle > 0){
            for (int i = start; i < start + l - 1; i++){
                r[sn] = matrix[start][i];
                sn++;
            }
            for (int i = start; i < start + h - 1; i++){
                r[sn] = matrix[i][start + l - 1];
                sn++;
            }
            for (int i = start; i < start + l - 1; i++){
                r[sn] = matrix[start + h - 1][start + l - 1 - (i - start)];
                sn++;
            }
            for (int i = start; i < start + h - 1; i++){
                r[sn] = matrix[start + h - 1 - (i - start)][start];
                sn++;
            }
            circle--;
            l -= 2;
            h -= 2;
            start++;
        }
        if (sn != length * high){
            if (l == 1){
                for (int i = start; i < start + h; i++){
                    r[sn] = matrix[i][start];
                    sn++;
                }
            }
            else if (h == 1){ #注意这边必须是else，不然可能会上下都运行
                for (int i = start; i < start + l; i++){
                    r[sn] = matrix[start][i];
                    sn++;
                }
            }
        }
        return r;
    }
};

#与螺旋画点题的思想类似，整体就是一点一点找出规律，从外到内依次赋值

class Solution {
public:
    vector<int> spiralOrder(vector<vector<int>>& matrix) {
        vector <int> ans;
        if(matrix.empty()) return ans; //若数组为空，直接返回答案
        int u = 0; //赋值上下左右边界
        int d = matrix.size() - 1;
        int l = 0;
        int r = matrix[0].size() - 1;
        while(true)
        {
            for(int i = l; i <= r; ++i) ans.push_back(matrix[u][i]); //向右移动直到最右
            if(++ u > d) break; //重新设定上边界，若上边界大于下边界，则遍历遍历完成，下同
            for(int i = u; i <= d; ++i) ans.push_back(matrix[i][r]); //向下
            if(-- r < l) break; //重新设定有边界
            for(int i = r; i >= l; --i) ans.push_back(matrix[d][i]); //向左
            if(-- d < u) break; //重新设定下边界
            for(int i = d; i >= u; --i) ans.push_back(matrix[i][l]); //向上
            if(++ l > r) break; //重新设定左边界
        }
        return ans;
    }
};

#从二维数组螺旋读数独有的方法，不断变更边界