feat: add python and java solutions to lcof problem

添加《剑指 Offer》题解：面试题13. 机器人的运动范围

Author: yanglbme

lcof/面试题13. 机器人的运动范围/README.md

@@ -0,0 +1,97 @@
+# [面试题13. 机器人的运动范围](https://leetcode-cn.com/problems/ji-qi-ren-de-yun-dong-fan-wei-lcof/)
+
+## 题目描述
+地上有一个m行n列的方格，从坐标 `[0,0]` 到坐标 `[m-1,n-1]` 。一个机器人从坐标 `[0, 0]` 的格子开始移动，它每次可以向左、右、上、下移动一格（不能移动到方格外），也不能进入行坐标和列坐标的数位之和大于k的格子。例如，当k为18时，机器人能够进入方格 `[35, 37]` ，因为 3+5+3+7=18。但它不能进入方格 `[35, 38]`，因为 3+5+3+8=19。请问该机器人能够到达多少个格子？
+
+**示例 1：**
+
+```
+输入：m = 2, n = 3, k = 1
+输出：3
+```
+
+**示例 2：**
+
+```
+输入：m = 3, n = 1, k = 0
+输出：1
+```
+
+**提示：**
+
+- `1 <= n,m <= 100`
+- `0 <= k <= 20`
+
+## 解法
+### Python3
+```python
+class Solution:
+
+    def __init__(self):
+        self._cnt = 0
+
+    def movingCount(self, m: int, n: int, k: int) -> int:
+        self._cnt = 0
+        visited = [[False for j in range(n)] for i in range(m)]
+        self.visit(0, 0, m, n, k, visited)
+        return self._cnt
+    
+    def visit(self, i, j, m, n, k, visited):
+        if i < 0 or i >= m or j < 0 or j >= n or visited[i][j] or self.cal(i, j) > k:
+            return
+        visited[i][j] = True
+        self._cnt += 1
+        self.visit(i - 1, j, m, n, k, visited)
+        self.visit(i + 1, j, m, n, k, visited)
+        self.visit(i, j - 1, m, n, k, visited)
+        self.visit(i, j + 1, m, n, k, visited)
+
+    def cal(self, m, n) -> int:
+        s = str(m) + str(n)
+        return sum([int(i) for i in s])
+```
+
+### Java
+```java
+class Solution {
+    private int cnt;
+
+    public int movingCount(int m, int n, int k) {
+        cnt = 0;
+        boolean[][] visited = new boolean[m][n];
+        visit(0, 0, m, n, k, visited);
+        return cnt;
+    }
+
+    private void visit(int i, int j, int m, int n, int k, boolean[][] visited) {
+        if (i < 0 || i >= m || j < 0 || j >= n || visited[i][j] || cal(i, j) > k) {
+            return;
+        }
+        visited[i][j] = true;
+        ++cnt;
+        visit(i - 1, j, m, n, k, visited);
+        visit(i + 1, j, m, n, k, visited);
+        visit(i, j - 1, m, n, k, visited);
+        visit(i, j + 1, m, n, k, visited);
+    }
+
+
+    private int cal(int i, int j) {
+        return cal(i) + cal(j);
+    }
+
+    private int cal(int val) {
+        int s = 0;
+        while (val != 0) {
+            s += (val % 10);
+            val /= 10;
+        }
+        return s;
+    }
+}
+```
+
+### ...
+```
+
+```

lcof/面试题13. 机器人的运动范围/Solution.java

@@ -0,0 +1,35 @@
+class Solution {
+    private int cnt;
+
+    public int movingCount(int m, int n, int k) {
+        cnt = 0;
+        boolean[][] visited = new boolean[m][n];
+        visit(0, 0, m, n, k, visited);
+        return cnt;
+    }
+
+    private void visit(int i, int j, int m, int n, int k, boolean[][] visited) {
+        if (i < 0 || i >= m || j < 0 || j >= n || visited[i][j] || cal(i, j) > k) {
+            return;
+        }
+        visited[i][j] = true;
+        ++cnt;
+        visit(i - 1, j, m, n, k, visited);
+        visit(i + 1, j, m, n, k, visited);
+        visit(i, j - 1, m, n, k, visited);
+        visit(i, j + 1, m, n, k, visited);
+    }
+
+    private int cal(int i, int j) {
+        return cal(i) + cal(j);
+    }
+
+    private int cal(int val) {
+        int s = 0;
+        while (val != 0) {
+            s += (val % 10);
+            val /= 10;
+        }
+        return s;
+    }
+}

lcof/面试题13. 机器人的运动范围/Solution.py

@@ -0,0 +1,24 @@
+class Solution:
+
+    def __init__(self):
+        self._cnt = 0
+
+    def movingCount(self, m: int, n: int, k: int) -> int:
+        self._cnt = 0
+        visited = [[False for j in range(n)] for i in range(m)]
+        self.visit(0, 0, m, n, k, visited)
+        return self._cnt
+    
+    def visit(self, i, j, m, n, k, visited):
+        if i < 0 or i >= m or j < 0 or j >= n or visited[i][j] or self.cal(i, j) > k:
+            return
+        visited[i][j] = True
+        self._cnt += 1
+        self.visit(i - 1, j, m, n, k, visited)
+        self.visit(i + 1, j, m, n, k, visited)
+        self.visit(i, j - 1, m, n, k, visited)
+        self.visit(i, j + 1, m, n, k, visited)
+
+    def cal(self, m, n) -> int:
+        s = str(m) + str(n)
+        return sum([int(i) for i in s])