Leetcode 54. 螺旋矩阵（DAY 158）---- LeetCode 精选 TOP 面试题

客官°小女子只卖身不卖艺 2022-09-09 06:21 159阅读 0赞

### 文章目录 ###

*   *  原题题目
     *  代码实现（首刷自解）

--------------------

## 原题题目 ##

--------------------

![在这里插入图片描述][watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBATG92ZSA2_size_20_color_FFFFFF_t_70_g_se_x_16]

--------------------

## 代码实现（首刷自解） ##

--------------------

class Solution { 
    public:
        vector<int> spiralOrder(vector<vector<int>>& matrix) { 
            vector<vector<bool>> visit(matrix.size(),vector<bool>(matrix[0].size(),false));
            vector<int> ret;
            bool down = false,up = false,left = false,right = true,flag = true;
            int x = 0,y = 0;
            int nextx,nexty;
            while(1)
            { 
                ret.emplace_back(matrix[x][y]);
                visit[x][y] = true;
                nextx = x,nexty = y;
                if(down)
                { 
                    ++nextx;
                    if(nextx == matrix.size() || visit[nextx][nexty])
                    { 
                        down = false;
                        left = true;
                        nextx -= 1;nexty -= 1;
                    }
                }
                else if(up)
                { 
                    --nextx;
                    if(nextx == -1 || visit[nextx][nexty])
                    { 
                        up = false;
                        right = true;
                        nextx += 1;nexty += 1;
                    }
                }
                else if(left)
                { 
                    --nexty;
                    if(nexty == -1 || visit[nextx][nexty])
                    { 
                        left = false;
                        up = true;
                        nextx -= 1;nexty += 1;
                    }
                }
                else if(right)
                { 
                    ++nexty;
                    if(nexty == matrix[0].size() || visit[nextx][nexty])
                    { 
                        right = false;
                        down = true;
                        nextx += 1;nexty -= 1; 
                    }
                }
                x = nextx,y = nexty;
                if(x == -1 || x == matrix.size() || y == -1 || y == matrix[0].size() || visit[x][y])
                    break;
            }
            return ret;
        }
    };

[watermark_type_ZHJvaWRzYW5zZmFsbGJhY2s_shadow_50_text_Q1NETiBATG92ZSA2_size_20_color_FFFFFF_t_70_g_se_x_16]: /images/20220829/81c9f1cc95944d82981ce7a64f7b39af.png