leetcode算法题--机器人的运动范围

原题链接：https://leetcode-cn.com/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/

dfs

int add(int a, int b) {
     int sum = 0;
     while (a) {
         sum += a % 10;
         a = a / 10;
     }
     while (b) {
         sum += b % 10;
         b = b / 10;
     }
     return sum;
 }

 int movingCount(int m, int n, int k) {    
     vector<vector<int>> used(m, vector<int>(n, 0));
     return movingCount(0, 0, m, n, k, used);       
 }

 int movingCount(int r, int c, int m, int n, int k ,vector<vector<int>>& used) {
     if(r < 0 || c < 0 || r >= m || c >= n || add(r, c) > k || used[r][c]) return 0;//如果边界超出，或者不满足条件，或者已经走过
     used[r][c] = 1;//将该点设置为走过
     return 1 + movingCount(r - 1, c, m, n, k, used) + movingCount(r + 1, c, m, n, k, used) + movingCount(r, c - 1, m, n, k, used) + movingCount(r, c + 1, m, n, k, used);//上下左右dfs
 }