diff --git a/problems/0213.打家劫舍II.md b/problems/0213.打家劫舍II.md
index 8e1ca126..dd109f83 100644
--- a/problems/0213.打家劫舍II.md
+++ b/problems/0213.打家劫舍II.md
@@ -143,6 +143,44 @@ class Solution:
         return dp[-1]
 ```
 
+Go：
+
+```go
+// 打家劫舍Ⅱ 动态规划
+// 时间复杂度O(n) 空间复杂度O(n)
+func rob(nums []int) int {
+    if len(nums) == 1 {
+        return nums[0]
+    }
+    if len(nums) == 2 {
+        return max(nums[0], nums[1])
+    }
+    
+    result1 := robRange(nums, 0)
+    result2 := robRange(nums, 1)
+    return max(result1, result2)
+}
+
+// 偷盗指定的范围
+func robRange(nums []int, start int) int {
+    dp := make([]int, len(nums))
+    dp[1] = nums[start]
+    
+    for i := 2; i < len(nums); i++ {
+        dp[i] = max(dp[i - 2] + nums[i - 1 + start], dp[i - 1])
+    }
+    
+    return dp[len(nums) - 1]
+}
+
+func max(a, b int) int {
+    if a > b {
+        return a
+    }
+    return b
+}
+```
+
 javascipt:
 ```javascript
 var rob = function(nums) {
@@ -187,44 +225,6 @@ function robRange(nums: number[], start: number, end: number): number {
 }
 ```
 
-Go：
-
-```go
-// 打家劫舍Ⅱ 动态规划
-// 时间复杂度O(n) 空间复杂度O(n)
-func rob(nums []int) int {
-    if len(nums) == 1 {
-        return nums[0]
-    }
-    if len(nums) == 2 {
-        return max(nums[0], nums[1])
-    }
-    
-    result1 := robRange(nums, 0)
-    result2 := robRange(nums, 1)
-    return max(result1, result2)
-}
-
-// 偷盗指定的范围
-func robRange(nums []int, start int) int {
-    dp := make([]int, len(nums))
-    dp[1] = nums[start]
-    
-    for i := 2; i < len(nums); i++ {
-        dp[i] = max(dp[i - 2] + nums[i - 1 + start], dp[i - 1])
-    }
-    
-    return dp[len(nums) - 1]
-}
-
-func max(a, b int) int {
-    if a > b {
-        return a
-    }
-    return b
-}
-```
-
 
 
 <p align="center">