[每日一题]498. Diagonal Traverse
来源:互联网 发布:findcontours源码实现 编辑:程序博客网 时间:2024/06/05 20:24
Given a matrix of M x N elements (M rows, N columns), return all elements of the matrix in diagonal order as shown in the below image.
Example:
Input:
[
[ 1, 2, 3 ],
[ 4, 5, 6 ],
[ 7, 8, 9 ]
]
Output: [1,2,4,7,5,3,6,8,9]
Explanation:
Note:
The total number of elements of the given matrix will not exceed 10,000.
Example:
Input:
[
[ 1, 2, 3 ],
[ 4, 5, 6 ],
[ 7, 8, 9 ]
]
Output: [1,2,4,7,5,3,6,8,9]
Explanation:
Note:
The total number of elements of the given matrix will not exceed 10,000.
#include <iostream>using namespace std;#define M 5#define N 4int main(){ int a[M][N]={ 1, 2, 3, 4, 5, 6, 7, 8, 9,10,11,12, 13,14,15,16, 17,18,19,20 }; int i=0,j=0; cout<<a[i][j]<<endl; while(i<M-1||j<N-1){ if(j<N-1){ cout<<a[i][++j]<<endl; }else if(i<M-1){ cout<<a[i][j]<<endl; } while(i<M-1&&j>0){ cout<<a[++i][--j]<<endl; } if(i<M-1){ cout<<a[++i][j]<<endl; }else if(j<N-1){ cout<<a[i][++j]<<endl; } while(i>0&&j<N-1){ cout<<a[--i][++j]<<endl; } }}
阅读全文
0 0
- [每日一题]498. Diagonal Traverse
- LeetCode 498. Diagonal Traverse
- 498. Diagonal Traverse
- [leetcode]498. Diagonal Traverse
- 498. Diagonal Traverse
- [LeetCode]498. Diagonal Traverse
- leetcode 498. Diagonal Traverse
- 498.Diagonal Traverse-M
- LeetCode: 498. Diagonal Traverse
- LeetCode笔记:498. Diagonal Traverse
- Diagonal Traverse
- [leetcode] 498. Diagonal Traverse -- JavaScript 代码
- [Leetcode] 498. Diagonal Traverse 解题报告
- leetcode 498. Diagonal Traverse 矩阵对角遍历
- Diagonal Traverse问题及解法
- leetcode_498. Diagonal Traverse ? 待解决
- 每日一题2
- 每日一题
- 切分文件名提取文件扩展名或提取文件名
- HDOJ2101 A + B Problem Too
- 琐事
- 排序算法(一)
- 游戏的基本体会
- [每日一题]498. Diagonal Traverse
- 深入浅出REST
- 天气晴朗的魔法
- ubuntu c++ 关机 重启 挂起 API
- 默慈金数学习小记 && 51nod 1556 计算
- IT领域的奇葩解读——反摩尔定律
- 二叉树(查询和删除)
- Android开发日常快捷键(不断更新)
- git&github常用日常