更正排版错误 优化代码更易理解

problems/0035.搜索插入位置.md

@@ -250,23 +250,23 @@ public int searchInsert(int[] nums, int target) {
 
 
 
-Golang:
+### Golang
 
-```golang
+```go
 // 第一种二分法
 func searchInsert(nums []int, target int) int {
-    l, r := 0, len(nums) - 1
+	left, right := 0, len(nums)-1
-    for l <= r{
+	for left <= right {
-        m := l + (r - l)/2
+		mid := left + (right-left)/2
-        if nums[m] == target{
+		if nums[mid] == target {
-            return m
+			return mid
-        }else if nums[m] > target{
+		} else if nums[mid] > target {
-            r = m - 1
+			right = mid - 1
-        }else{
+		} else {
-            l = m + 1
+			left = mid + 1
-        }
+		}
-    }
+	}
-    return r + 1
+	return len(nums)
 }
 ```