Merge branch 'master' of https://github.com/azl397985856/leetcode

Author: lucifer

README.md

@@ -5,8 +5,8 @@
 [![Travis](https://img.shields.io/badge/language-Python-red.svg)]()
 [![Travis](https://img.shields.io/badge/language-Java-blue.svg)]()
 
-[![](https://img.shields.io/badge/WeChat-微信群-brightgreen)](#关注我）
-[![](https://img.shields.io/badge/公众号-力扣加加-blueviolet)](#关注我）
+[![](https://img.shields.io/badge/WeChat-微信群-brightgreen)](#哪里能找到我)
+[![](https://img.shields.io/badge/公众号-力扣加加-blueviolet)](#哪里能找到我)
 [![](https://img.shields.io/badge/Juejin-掘金-blue)](https://juejin.im/user/58af98305c497d0067780b3b)
 [![](https://img.shields.io/badge/Zhihu-知乎-blue)](https://www.zhihu.com/people/lu-xiao-13-70)
 [![](https://img.shields.io/badge/bilili-哔哩哔哩-ff69b4)](https://space.bilibili.com/519510412/)

problems/62.unique-paths.md

@@ -110,8 +110,7 @@ class Solution:
     def uniquePaths(self, m: int, n: int) -> int:
         if m == 1 or n == 1:
             return 1
-        cnt = self.uniquePaths(m - 1, n) + self.uniquePaths(m, n - 1)
-        return cnt
+        return self.uniquePaths(m - 1, n) + self.uniquePaths(m, n - 1)
 ```