【Leetcode】498. Diagonal Traverse

题目地址：

https://leetcode.com/problems/diagonal-traverse/

给定一个二维矩阵$n$行$m$列，显然形如从左下到右上的对角线，一共有$n+m-1$条。现在从右上到左下将这些对角线编号为$0,1,2,...,n+m-2$，要求按照编号为偶数的对角线从左下到右上遍历，编号为奇数的对角线从右上到左下遍历。返回遍历的结果。

可以先遍历矩阵左上半部分的对角线，然后遍历右下半部分的对角线，并且记录遍历的顺序是顺序还是逆序。代码如下：

import java.util.ArrayList;
import java.util.List;

public class Solution {
    public int[] findDiagonalOrder(int[][] matrix) {
        if (matrix == null || matrix.length == 0 || matrix[0].length == 0) {
            return new int[0];
        }
    
        int n = matrix.length, m = matrix[0].length;
        
        int[] res = new int[n * m];
        int idx = 0;
        boolean reversed = true;
        for (int i = 0; i < m; i++) {
            List<Integer> diag = new ArrayList<>();
            int x = 0, y = i;
            while (x < n && y >= 0) {
                diag.add(matrix[x][y]);
                x++;
                y--;
            }
            
            if (!reversed) {
                for (int j = 0; j < diag.size(); j++) {
                    res[idx++] = diag.get(j);
                }
            } else {
                for (int j = diag.size() - 1; j >= 0; j--) {
                    res[idx++] = diag.get(j);
                }
            }
            
            // 遍历完一条对角线后改变reversed的值
            reversed = !reversed;
        }
    
        for (int i = 1; i < n; i++) {
            List<Integer> diag = new ArrayList<>();
            int x = i, y = m - 1;
            while (x < n && y >= 0) {
                diag.add(matrix[x][y]);
                x++;
                y--;
            }
    
            if (!reversed) {
                for (int j = 0; j < diag.size(); j++) {
                    res[idx++] = diag.get(j);
                }
            } else {
                for (int j = diag.size() - 1; j >= 0; j--) {
                    res[idx++] = diag.get(j);
                }
            }
            
            reversed = !reversed;
        }
        
        return res;
    }
}

时间复杂度$O(mn)$，空间$O(\min (n,m))$。