feat: use sort.SearchInts in golang code snippets

solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/README.md

@@ -191,8 +191,8 @@ var searchRange = function (nums, target) {
 
 ```go
 func searchRange(nums []int, target int) []int {
-	l := sort.Search(len(nums), func(i int) bool { return nums[i] >= target })
-	r := sort.Search(len(nums), func(i int) bool { return nums[i] > target })
+	l := sort.SearchInts(nums, target)
+	r := sort.SearchInts(nums, target+1)
 	if l == r {
 		return []int{-1, -1}
 	}

solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/README_EN.md

@@ -156,8 +156,8 @@ var searchRange = function (nums, target) {
 
 ```go
 func searchRange(nums []int, target int) []int {
-	l := sort.Search(len(nums), func(i int) bool { return nums[i] >= target })
-	r := sort.Search(len(nums), func(i int) bool { return nums[i] > target })
+	l := sort.SearchInts(nums, target)
+	r := sort.SearchInts(nums, target+1)
 	if l == r {
 		return []int{-1, -1}
 	}

solution/0000-0099/0034.Find First and Last Position of Element in Sorted Array/Solution.go

@@ -1,6 +1,6 @@
 func searchRange(nums []int, target int) []int {
-	l := sort.Search(len(nums), func(i int) bool { return nums[i] >= target })
-	r := sort.Search(len(nums), func(i int) bool { return nums[i] > target })
+	l := sort.SearchInts(nums, target)
+	r := sort.SearchInts(nums, target+1)
 	if l == r {
 		return []int{-1, -1}
 	}

solution/0000-0099/0035.Search Insert Position/README.md

@@ -147,7 +147,7 @@ func searchInsert(nums []int, target int) int {
 
 ```go
 func searchInsert(nums []int, target int) int {
-	return sort.Search(len(nums), func(i int) bool { return nums[i] >= target })
+	return sort.SearchInts(nums, target)
 }
 ```
 

solution/0000-0099/0035.Search Insert Position/README_EN.md

@@ -133,7 +133,7 @@ func searchInsert(nums []int, target int) int {
 
 ```go
 func searchInsert(nums []int, target int) int {
-	return sort.Search(len(nums), func(i int) bool { return nums[i] >= target })
+	return sort.SearchInts(nums, target)
 }
 ```
 

solution/1100-1199/1150.Check If a Number Is Majority Element in a Sorted Array/README.md

@@ -160,17 +160,16 @@ public:
 
 ```go
 func isMajorityElement(nums []int, target int) bool {
-	n := len(nums)
-	left := sort.Search(n, func(i int) bool { return nums[i] >= target })
-	right := sort.Search(n, func(i int) bool { return nums[i] > target })
-	return right-left > n/2
+	left := sort.SearchInts(nums, target)
+	right := sort.SearchInts(nums, target+1)
+	return right-left > len(nums)/2
 }
 ```
 
 ```go
 func isMajorityElement(nums []int, target int) bool {
 	n := len(nums)
-	left := sort.Search(n, func(i int) bool { return nums[i] >= target })
+	left := sort.SearchInts(nums, target)
 	right := left + n/2
 	return right < n && nums[right] == target
 }

solution/1100-1199/1150.Check If a Number Is Majority Element in a Sorted Array/README_EN.md

@@ -136,17 +136,16 @@ public:
 
 ```go
 func isMajorityElement(nums []int, target int) bool {
-	n := len(nums)
-	left := sort.Search(n, func(i int) bool { return nums[i] >= target })
-	right := sort.Search(n, func(i int) bool { return nums[i] > target })
-	return right-left > n/2
+	left := sort.SearchInts(nums, target)
+	right := sort.SearchInts(nums, target+1)
+	return right-left > len(nums)/2
 }
 ```
 
 ```go
 func isMajorityElement(nums []int, target int) bool {
 	n := len(nums)
-	left := sort.Search(n, func(i int) bool { return nums[i] >= target })
+	left := sort.SearchInts(nums, target)
 	right := left + n/2
 	return right < n && nums[right] == target
 }

solution/1100-1199/1150.Check If a Number Is Majority Element in a Sorted Array/Solution.go

@@ -1,6 +1,5 @@
 func isMajorityElement(nums []int, target int) bool {
-	n := len(nums)
-	left := sort.Search(n, func(i int) bool { return nums[i] >= target })
-	right := sort.Search(n, func(i int) bool { return nums[i] > target })
-	return right-left > n/2
+	left := sort.SearchInts(nums, target)
+	right := sort.SearchInts(nums, target+1)
+	return right-left > len(nums)/2
 }

solution/1400-1499/1488.Avoid Flood in The City/README.md

@@ -198,7 +198,7 @@ func avoidFlood(rains []int) []int {
 	for i, v := range rains {
 		if v > 0 {
 			if j, ok := rainy[v]; ok {
-				idx := sort.Search(len(sunny), func(i int) bool { return sunny[i] > j })
+				idx := sort.SearchInts(sunny, j+1)
 				if idx == len(sunny) {
 					return []int{}
 				}

solution/1400-1499/1488.Avoid Flood in The City/README_EN.md

@@ -188,7 +188,7 @@ func avoidFlood(rains []int) []int {
 	for i, v := range rains {
 		if v > 0 {
 			if j, ok := rainy[v]; ok {
-				idx := sort.Search(len(sunny), func(i int) bool { return sunny[i] > j })
+				idx := sort.SearchInts(sunny, j+1)
 				if idx == len(sunny) {
 					return []int{}
 				}

solution/1400-1499/1488.Avoid Flood in The City/Solution.go

@@ -9,7 +9,7 @@ func avoidFlood(rains []int) []int {
 	for i, v := range rains {
 		if v > 0 {
 			if j, ok := rainy[v]; ok {
-				idx := sort.Search(len(sunny), func(i int) bool { return sunny[i] > j })
+				idx := sort.SearchInts(sunny, j+1)
 				if idx == len(sunny) {
 					return []int{}
 				}

solution/1700-1799/1774.Closest Dessert Cost/README.md

@@ -254,7 +254,7 @@ func closestCost(baseCosts []int, toppingCosts []int, target int) int {
 		// 枚举子集和
 		for _, y := range arr {
 			// 二分查找
-			i := sort.Search(len(arr), func(i int) bool { return arr[i] >= target-x-y })
+			i := sort.SearchInts(arr, target-x-y)
 			for j := i - 1; j < i+1; j++ {
 				if j >= 0 && j < len(arr) {
 					t := abs(x + y + arr[j] - target)

solution/1700-1799/1774.Closest Dessert Cost/README_EN.md

@@ -215,7 +215,7 @@ func closestCost(baseCosts []int, toppingCosts []int, target int) int {
 	ans, d := inf, inf
 	for _, x := range baseCosts {
 		for _, y := range arr {
-			i := sort.Search(len(arr), func(i int) bool { return arr[i] >= target-x-y })
+			i := sort.SearchInts(arr, target-x-y)
 			for j := i - 1; j < i+1; j++ {
 				if j >= 0 && j < len(arr) {
 					t := abs(x + y + arr[j] - target)

solution/1700-1799/1774.Closest Dessert Cost/Solution.go

@@ -15,7 +15,7 @@ func closestCost(baseCosts []int, toppingCosts []int, target int) int {
 	ans, d := inf, inf
 	for _, x := range baseCosts {
 		for _, y := range arr {
-			i := sort.Search(len(arr), func(i int) bool { return arr[i] >= target-x-y })
+			i := sort.SearchInts(arr, target-x-y)
 			for j := i - 1; j < i+1; j++ {
 				if j >= 0 && j < len(arr) {
 					t := abs(x + y + arr[j] - target)

solution/1800-1899/1818.Minimum Absolute Sum Difference/README.md

@@ -193,7 +193,7 @@ func minAbsoluteSumDiff(nums1 []int, nums2 []int) int {
 	for i, a := range nums1 {
 		b := nums2[i]
 		d1, d2 := abs(a-b), 1<<30
-		j := sort.Search(n, func(k int) bool { return nums[k] >= b })
+		j := sort.SearchInts(nums, b)
 		if j < n {
 			d2 = min(d2, abs(nums[j]-b))
 		}

solution/1800-1899/1818.Minimum Absolute Sum Difference/README_EN.md

@@ -176,7 +176,7 @@ func minAbsoluteSumDiff(nums1 []int, nums2 []int) int {
 	for i, a := range nums1 {
 		b := nums2[i]
 		d1, d2 := abs(a-b), 1<<30
-		j := sort.Search(n, func(k int) bool { return nums[k] >= b })
+		j := sort.SearchInts(nums, b)
 		if j < n {
 			d2 = min(d2, abs(nums[j]-b))
 		}

solution/1800-1899/1818.Minimum Absolute Sum Difference/Solution.go

@@ -12,7 +12,7 @@ func minAbsoluteSumDiff(nums1 []int, nums2 []int) int {
 	for i, a := range nums1 {
 		b := nums2[i]
 		d1, d2 := abs(a-b), 1<<30
-		j := sort.Search(n, func(k int) bool { return nums[k] >= b })
+		j := sort.SearchInts(nums, b)
 		if j < n {
 			d2 = min(d2, abs(nums[j]-b))
 		}