二维数组对角线遍历
问题描述
给定二维数组,然后按照对角线折返遍历。
解法一
通过大量的ifelse对情况进行分类,最无脑的做法:
class Solution {
public:
vector<int> findDiagonalOrder(vector<vector<int>>& matrix) {
int row = matrix.size();
if (row == 0) return{
};
int col = matrix[0].size();
vector<int> diagonal;
if (row == 1) {
for (int i = 0; i < col; i++) {
diagonal.push_back(matrix[0][i]);
}
return diagonal;
}
if(col == 1) {
for (int i = 0; i < row; i++) {
diagonal.push_back(matrix[i][0]);
}
return diagonal;
}
int i = 0, j = 0;