Update 31. 下一个排列.md

Author: CompetitiveLin

Methodology/31. 下一个排列.md

@@ -82,4 +82,32 @@ class Solution {
         nums[j] = temp;
     }
 }
-```
+```
+
+
+
+Go：
+
+```go
+func nextPermutation(nums []int)  {
+    i, j := 0, len(nums) - 1
+    for ;j > 0; j-- {
+        if nums[j] > nums[j - 1] {
+            i = j - 1
+            break
+        }
+    }
+    for k := len(nums) - 1; k >= j; k-- {
+        if nums[k] > nums[i] {
+            nums[i], nums[k] = nums[k], nums[i]
+            break
+        }
+    }
+
+    for k := len(nums) - 1; k > j; k, j = k - 1, j + 1 {
+        nums[j], nums[k] = nums[k], nums[j]
+    }
+    return
+}
+```
+