1901.Find a peak element 2

class Solution {
    public int[] findPeakGrid(int[][] mat) {
        int arr[]=new int[2];
        System.out.print(mat.length+" "+"0"+mat[0].length);
        for(int i=0;i<mat.length;i++){
            for(int j=0;j<mat[i].length;j++){
                int val=mat[i][j];
                int rig=j+1<mat[0].length?mat[i][j+1]:0;
                int top=i-1>=0?mat[i-1][j]:0;
                int bott=i+1<mat.length?mat[i+1][j]:0;
                int left=j-1>=0?mat[i][j-1]:0;
            if(mat[i][j]<top){continue;}
            if(mat[i][j]<bott){continue;}
            if(mat[i][j]<rig){continue;}
            if(mat[i][j]<left){continue;} 
              arr[0]=i;
              arr[1]=j;
            }
        }
        return arr;
    }
}