Spiral Matrix
来源:互联网 发布:儒释道网络电视台 编辑:程序博客网 时间:2024/06/02 00:01
http://www.cnblogs.com/ganganloveu/p/4157376.html
【LeetCode】54. Spiral Matrix
Spiral Matrix
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]
.
对于每一层(记为层i),以(i,i)位置出发,向右到达(i,n-1-i),向下到达(m-1-i,n-1-i),向左到达(m-1-i,i),再向上回到起点。
(当4维数的时候,i=0,i=1)
所有层次遍历完成后,即得到所求数组
注意:i==m-1-i 或者 i==n-1-i时,不要来回重复遍历。
class Solution {public: vector<int> spiralOrder(vector<vector<int> > &matrix) { vector<int> ret; if(matrix.empty() || matrix[0].empty()) return ret; int m = matrix.size(); int n = matrix[0].size(); int layer = (min(m,n)+1) / 2; for(int i = 0; i < layer; i ++) { //row i: top-left --> top-right for(int j = i; j < n-i; j ++) ret.push_back(matrix[i][j]); //col n-1-i: top-right --> bottom-right for(int j = i+1; j < m-i; j ++) ret.push_back(matrix[j][n-1-i]); //row m-1-i: bottom-right --> bottom-left if(m-1-i > i) { for(int j = n-1-i-1; j >= i; j --) ret.push_back(matrix[m-1-i][j]); } //col i: bottom-left --> top-left if(n-1-i > i) { for(int j = m-1-i-1; j > i; j --) ret.push_back(matrix[j][i]); } } return ret; }};
0 0
- Spiral Matrix
- Spiral Matrix
- Spiral Matrix
- Spiral Matrix
- Spiral Matrix
- Spiral Matrix
- Spiral Matrix
- Spiral Matrix
- Spiral Matrix
- Spiral Matrix
- Spiral Matrix
- Spiral Matrix
- Spiral Matrix
- Spiral Matrix
- Spiral Matrix
- Spiral Matrix
- Spiral Matrix
- Spiral Matrix
- 纯JS省市区三级级联
- Spring-data-jpa详解,全方位介绍。
- Bootstrap Table使用分享
- MySql 存储过程实战(附完整注释)
- 自绘按钮
- Spiral Matrix
- Wunder Fund Round 2016 (Div. 1 + Div. 2 combined) B. Guess the Permutation
- debug.keystore密码
- 分库后如何处理分页?
- 【IOS学习】最新版SDWebImage的使用
- CentOS7 安装 orcle12c步骤整理
- Convert Sorted List to Binary Search Tree
- 欢迎使用CSDN-markdown编辑器
- JavaScript 事件流、事件处理程序及事件对象总结