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
- leetcode之Spiral Matrix
- LeetCode之Spiral Matrix
- LeetCode之Spiral Matrix
- leetcode之Spiral Matrix
- 【Leetcode】之 Spiral Matrix
- LeetCode之Spiral Matrix II
- LeetCode之Spiral Matrix II
- leetcode之Spiral Matrix II
- 【Leetcode】之Spiral Matrix II
- Leetcode之 Spiral Matrix 问题
- leetcode之Spiral Matrix 和Spiral Matrix II
- LeetCode第54题之Spiral Matrix
- LeetCode进阶之路(Spiral Matrix)
- LeetCode之Spiral Matrix----圈圈访问数组
- Leetcode之Spiral Matrix II 问题
- [leetcode]Spiral Matrix&&Spiral Matrix II
- Leetcode:Spiral Matrix与Spiral Matrix II
- LeetCode | Spiral Matrix /Spiral Matrix II
- C/c++中移位与负数表达的一点研究
- Native关键字---小笔记
- HDU 3442 Three Kingdoms BFS + 优先队列
- 信息系统项目管理-题记
- Windows7虚拟盘(VHD)API
- LeetCode之Spiral Matrix
- Java面试宝典2014版
- DS1621在Linux下的IIC接口驱动设计
- the project file '' has been renamed or is no longer in the solution 解决办法
- 类型转换 CString String int 相互转换
- AM-Notebook 6.3 注册KEY分析 与内存补丁:
- 在JSP页面中通过JS动态显示时间程序
- HR面试问题
- Ruby Gem 慢甚至超时问题