class Solution { int m,n,k; boolean[][] visited; public int movingCount(int threshold, int rows, int cols) { if(k<0) return 0; this.m = rows; this.n = cols; this.k = threshold; //记录每一个坐标是否走过 this.visited = new boolean[m][n]; ...