62.不同路径增加Go数论方法

problems/0062.不同路径.md

@@ -371,6 +371,7 @@ class Solution:
 ```
 ### Go
 
+动态规划
 ```Go
 func uniquePaths(m int, n int) int {
 	dp := make([][]int, m)
@@ -390,6 +391,26 @@ func uniquePaths(m int, n int) int {
 }
 ```
 
+数论方法
+```Go
+func uniquePaths(m int, n int) int {
+    numerator := 1
+    denominator := m - 1
+    count := m - 1
+    t := m + n - 2
+    for count > 0 {
+        numerator *= t
+        t--
+        for denominator != 0 && numerator % denominator == 0 {
+            numerator /= denominator
+            denominator--
+        }
+        count--
+    }
+    return numerator
+}
+```
+
 ### Javascript
 
 ```Javascript