LeetCode498.对角线遍历（Java实现）

链接：https://leetcode-cn.com/problems/diagonal-traverse/

class Solution {
    public int[] findDiagonalOrder(int[][] matrix) {
        if(matrix==null||matrix.length==0){
            return new int[0];
        }
        int x=0,y=0;
        boolean direct=true;
        int len=matrix.length*matrix[0].length;
        int[] nums=new int[len];
        int index=0;
        while(true){
            nums[index]=matrix[x][y];
            index++;
            if(index==len){
                break;
            }
            if(direct){
                x--;
                y++;
            }else{
                x++;
                y--;
            }
            if(x<0||x>matrix.length-1||y<0||y>matrix[0].length-1){
                if(direct){
                    x++;
                    if(y>matrix[0].length-1){
                        y--;
                        x++;
                    }
                }else{
                    y++;
                    if(x>matrix.length-1){
                        x--;
                        y++;
                    }
                }
                direct=!direct;
            }
        }
        return nums;
    }
}