add new solutions

solutions/1/q153/solution.go

@@ -0,0 +1,18 @@
+package q153
+
+func findMin(nums []int) int {
+	l, r := 0, len(nums)
+
+	for l < r && nums[l] > nums[r-1] {
+		m := (l + r) / 2
+		if nums[m] > nums[r-1] {
+			l = m + 1
+		} else {
+			r = m + 1
+			l++
+		}
+	}
+	return nums[l]
+}
+
+var _ = findMin