chenxinjk2的专栏

Thoughts:The main problem , is to solve the condition that mid == target.If mid == target, we need find the range of the target.So how to find the range of the target?1.Binary Search Solution1Problem: too many codes.class Solution { public int[]

1.Simple Easy Thinking SolutionBinary SearchTime Complexity: O(logn)class Solution { public int findMin(int[] nums) { // The difference between 33. Search in Rotated Sorted Array and this one is: // This question find the mim and the o

Description[Easy]Let’s call an array arra mountain if the following properties hold:arr.length >= 3There exists some i with 0 < i < arr.length - 1 such that:arr[0] < arr[1] < ... arr[i-1] < arr[i]arr[i] > arr[i+1] > ... >