aboutsummaryrefslogtreecommitdiffstats
path: root/34
diff options
context:
space:
mode:
authorterminaldweller <thabogre@gmail.com>2022-07-25 04:22:50 +0000
committerterminaldweller <thabogre@gmail.com>2022-07-25 04:22:50 +0000
commit7920e102cdfcbcb2ed2da460a225ace0a2c4175d (patch)
tree071a71d9a9ec90ae43eaa17279bb03a1d7a84f2d /34
parentupdate (diff)
downloadleetcode-7920e102cdfcbcb2ed2da460a225ace0a2c4175d.tar.gz
leetcode-7920e102cdfcbcb2ed2da460a225ace0a2c4175d.zip
updates
Diffstat (limited to '34')
-rw-r--r--34/go.mod3
-rw-r--r--34/main.go68
2 files changed, 71 insertions, 0 deletions
diff --git a/34/go.mod b/34/go.mod
new file mode 100644
index 0000000..c8daff8
--- /dev/null
+++ b/34/go.mod
@@ -0,0 +1,3 @@
+module 34
+
+go 1.17
diff --git a/34/main.go b/34/main.go
new file mode 100644
index 0000000..14a627f
--- /dev/null
+++ b/34/main.go
@@ -0,0 +1,68 @@
+package main
+
+import "fmt"
+
+func explore(nums []int, index int) []int {
+ low := index
+ high := index
+ for {
+ if low-1 >= 0 {
+ if nums[low-1] == nums[index] {
+ low--
+ } else {
+ break
+ }
+ } else {
+ break
+ }
+ }
+
+ for {
+ if high+1 < len(nums) {
+ if nums[high+1] == nums[index] {
+ high++
+ } else {
+ break
+ }
+ } else {
+ break
+ }
+ }
+
+ return []int{low, high}
+}
+
+func searchRange(nums []int, target int) []int {
+ low := 0
+ high := len(nums) - 1
+
+ for low <= high {
+ median := (high + low) / 2
+ fmt.Println(low, high, median)
+ if target > nums[median] {
+ low = median + 1
+ } else {
+ high = median - 1
+ }
+ }
+
+ if low == len(nums) || nums[low] != target {
+ return []int{-1, -1}
+ }
+
+ return explore(nums, low)
+}
+
+func main() {
+ nums1 := []int{5, 7, 7, 8, 8, 10}
+ nums2 := []int{5, 7, 7, 8, 8, 10}
+ nums3 := []int{}
+ nums5 := []int{5, 7, 7, 8, 8, 10}
+ nums4 := []int{1}
+ fmt.Println(searchRange(nums3, 0))
+ fmt.Println(searchRange(nums1, 8))
+ fmt.Println(searchRange(nums2, 6))
+ fmt.Println(searchRange(nums5, 1))
+ fmt.Println(searchRange(nums5, 100))
+ fmt.Println(searchRange(nums4, 1))
+}