Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 782d3f0

Browse files
feat: use sort.SearchInts in golang code snippets (doocs#1988)
1 parent f83fc91 commit 782d3f0

File tree

17 files changed

+28
-31
lines changed

17 files changed

+28
-31
lines changed

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

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -191,8 +191,8 @@ var searchRange = function (nums, target) {
191191

192192
```go
193193
func searchRange(nums []int, target int) []int {
194-
l := sort.Search(len(nums), func(i int) bool { return nums[i] >= target })
195-
r := sort.Search(len(nums), func(i int) bool { return nums[i] > target })
194+
l := sort.SearchInts(nums, target)
195+
r := sort.SearchInts(nums, target+1)
196196
if l == r {
197197
return []int{-1, -1}
198198
}

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

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -156,8 +156,8 @@ var searchRange = function (nums, target) {
156156

157157
```go
158158
func searchRange(nums []int, target int) []int {
159-
l := sort.Search(len(nums), func(i int) bool { return nums[i] >= target })
160-
r := sort.Search(len(nums), func(i int) bool { return nums[i] > target })
159+
l := sort.SearchInts(nums, target)
160+
r := sort.SearchInts(nums, target+1)
161161
if l == r {
162162
return []int{-1, -1}
163163
}

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

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
func searchRange(nums []int, target int) []int {
2-
l := sort.Search(len(nums), func(iint) bool { returnnums[i] >=target })
3-
r := sort.Search(len(nums), func(iint) bool { returnnums[i] >target })
2+
l := sort.SearchInts(nums, target)
3+
r := sort.SearchInts(nums, target+1)
44
if l == r {
55
return []int{-1, -1}
66
}

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -147,7 +147,7 @@ func searchInsert(nums []int, target int) int {
147147

148148
```go
149149
func searchInsert(nums []int, target int) int {
150-
return sort.Search(len(nums), func(i int) bool { return nums[i] >= target })
150+
return sort.SearchInts(nums, target)
151151
}
152152
```
153153

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -133,7 +133,7 @@ func searchInsert(nums []int, target int) int {
133133

134134
```go
135135
func searchInsert(nums []int, target int) int {
136-
return sort.Search(len(nums), func(i int) bool { return nums[i] >= target })
136+
return sort.SearchInts(nums, target)
137137
}
138138
```
139139

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

Lines changed: 4 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -160,17 +160,16 @@ public:
160160

161161
```go
162162
func isMajorityElement(nums []int, target int) bool {
163-
n := len(nums)
164-
left := sort.Search(n, func(i int) bool { return nums[i] >= target })
165-
right := sort.Search(n, func(i int) bool { return nums[i] > target })
166-
return right-left > n/2
163+
left := sort.SearchInts(nums, target)
164+
right := sort.SearchInts(nums, target+1)
165+
return right-left > len(nums)/2
167166
}
168167
```
169168

170169
```go
171170
func isMajorityElement(nums []int, target int) bool {
172171
n := len(nums)
173-
left := sort.Search(n, func(i int) bool { return nums[i] >= target })
172+
left := sort.SearchInts(nums, target)
174173
right := left + n/2
175174
return right < n && nums[right] == target
176175
}

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

Lines changed: 4 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -136,17 +136,16 @@ public:
136136

137137
```go
138138
func isMajorityElement(nums []int, target int) bool {
139-
n := len(nums)
140-
left := sort.Search(n, func(i int) bool { return nums[i] >= target })
141-
right := sort.Search(n, func(i int) bool { return nums[i] > target })
142-
return right-left > n/2
139+
left := sort.SearchInts(nums, target)
140+
right := sort.SearchInts(nums, target+1)
141+
return right-left > len(nums)/2
143142
}
144143
```
145144

146145
```go
147146
func isMajorityElement(nums []int, target int) bool {
148147
n := len(nums)
149-
left := sort.Search(n, func(i int) bool { return nums[i] >= target })
148+
left := sort.SearchInts(nums, target)
150149
right := left + n/2
151150
return right < n && nums[right] == target
152151
}
Lines changed: 3 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
func isMajorityElement(nums []int, target int) bool {
2-
n := len(nums)
3-
left := sort.Search(n, func(i int) bool { return nums[i] >= target })
4-
right := sort.Search(n, func(i int) bool { return nums[i] > target })
5-
return right-left > n/2
2+
left := sort.SearchInts(nums, target)
3+
right := sort.SearchInts(nums, target+1)
4+
return right-left > len(nums)/2
65
}

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -198,7 +198,7 @@ func avoidFlood(rains []int) []int {
198198
for i, v := range rains {
199199
if v > 0 {
200200
if j, ok := rainy[v]; ok {
201-
idx := sort.Search(len(sunny), func(i int) bool { return sunny[i] > j })
201+
idx := sort.SearchInts(sunny, j+1)
202202
if idx == len(sunny) {
203203
return []int{}
204204
}

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

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -188,7 +188,7 @@ func avoidFlood(rains []int) []int {
188188
for i, v := range rains {
189189
if v > 0 {
190190
if j, ok := rainy[v]; ok {
191-
idx := sort.Search(len(sunny), func(i int) bool { return sunny[i] > j })
191+
idx := sort.SearchInts(sunny, j+1)
192192
if idx == len(sunny) {
193193
return []int{}
194194
}

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /