教育企业重庆网站建设seo门户网

题目思路：

代码设计：

代码呈现：

class Solution {int m,n,cnt,ret;boolean[][] vis;//注意：自动回溯的不能标记int[] dx = {0,0,-1,1};int[] dy = {1,-1,0,0};public int wardrobeFinishing(int _m, int _n, int _cnt) {m = _m; n = _n; cnt = _cnt;vis = new boolean[m][n];dfs(0,0);return ret;}private void dfs(int i, int j){vis[i][j] = true;ret++;for(int k = 0; k < 4; k++){int x = i + dx[k]; int y = j + dy[k];if(x >= 0 && x < m && y >= 0 && y < n && !vis[x][y] && check(x,y)){dfs(x,y);}}}private boolean check(int i, int j){int tmp = 0;while (i != 0){tmp += i % 10;i /= 10;}while (j != 0){tmp += j % 10;j /= 10;}return tmp <= cnt;}}