add: find-minimum-in-rotated-sorted-array solution in go (#26)

Author: cosmicray001

README.md

@@ -156,7 +156,7 @@ LeetCode
 |0150|[Evaluate Reverse Polish Notation](https://leetcode.com/problems/evaluate-reverse-polish-notation/) || [c++](./src/0150-Evaluate-Reverse-Polish-Notation/0150.cpp) |[python](./src/0150-Evaluate-Reverse-Polish-Notation/0150.py)|||||Medium|
 |0151|[Reverse Words in a String](https://leetcode.com/problems/evaluate-reverse-polish-notation/) || [c++](./src/0151-Reverse-Words-in-a-String/0151.cpp) |[python](./src/0151-Reverse-Words-in-a-String/0151.py)|||||Medium|
 |0152|[Maximum Product Subarray](https://leetcode.com/problems/evaluate-reverse-polish-notation/) || [c++](./src/0152-Maximum-Product-Subarray/0152.cpp) |[python](./src/0152-Maximum-Product-Subarray/0152.py)|||||Medium|
-|0153|[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) || [c++](./src/0153-Find-Minimum-in-Rotated-Sorted-Array/0153.cpp) |[python](./src/0153-Find-Minimum-in-Rotated-Sorted-Array/0153.py)|||||Medium|
+|0153|[Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) || [c++](./src/0153-Find-Minimum-in-Rotated-Sorted-Array/0153.cpp) |[python](./src/0153-Find-Minimum-in-Rotated-Sorted-Array/0153.py)|[go](./src/0153-Find-Minimum-in-Rotated-Sorted-Array/0153.go)||||Medium|
 |0154|[Find Minimum in Rotated Sorted Array II](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/) || [c++](./src/0154-Find-Minimum-in-Rotated-Sorted-Array-II/0154.cpp) |[python](./src/0154-Find-Minimum-in-Rotated-Sorted-Array-II/0154.py)|||||Hard|
 |0155|[Min Stack](https://leetcode.com/problems/min-stack/) || [c++](./src/0155-Min-Stack/0155.cpp) |[python](./src/0155-Min-Stack/0155.py)|||||Easy|
 |0160|[Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) || [c++](./src/0160-Intersection-of-Two-Linked-Lists/0160.cpp) |[python](./src/0160-Intersection-of-Two-Linked-Lists/0160.py)|||||Easy|

src/0153-Find-Minimum-in-Rotated-Sorted-Array/0153.go

@@ -0,0 +1,15 @@
+package findminimuminrotatedsortedarray
+
+func findMin(nums []int) int {
+	var mid int
+	lo, hi := 0, len(nums)-1
+	for lo < hi {
+		mid = lo + (hi-lo)/2
+		if nums[mid] > nums[hi] {
+			lo = mid + 1
+		} else {
+			hi = mid
+		}
+	}
+	return nums[lo]
+}