LeetCode153 Find Minimum in Rotated Sorted Array. LeetCode162 Find Peak Element

二分法相关

153. Find Minimum in Rotated Sorted Array

Suppose a sorted array is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

Find the minimum element.

You may assume no duplicate exists in the array. （Medium）

分析：

根据旋转排序数组性质，问题转化为find first element which is bigger than nums[nums.size() - 1];

代码：

 class Solution {
 public:
     int findMin(vector<int>& nums) {
         int start = , end = nums.size() - ;
         int target = nums[nums.size() - ];
         while(start +  < end){
             int mid = start + (end - start) / ;
             if(nums[mid] > target){
                 start = mid;
             }
             else{
                 end = mid;
             }
         }
         if(nums[start] < target){
             return nums[start];
         }
         return nums[end];
     }
 };

162. Find Peak Element

A peak element is an element that is greater than its neighbors.

Given an input array where num[i] ≠ num[i+1], find a peak element and return its index.

The array may contain multiple peaks, in that case return the index to any one of the peaks is fine.

You may imagine that num[-1] = num[n] = -∞.

For example, in array [1, 2, 3, 1], 3 is a peak element and your function should return the index number 2. （Medium）

分析：

因为题目假设了num[-1] = num[n] = - 所以对于nums[mid]来讲，其与左右元素之间无非只有三种情况：

（1） nums[mid-1] < nums[mid] && nums[mid] > nums[mid+1] ，此时mid即为peak element;

（2） nums[mid-1] < nums[mid] && nums[mid] < nums[mid+1]，此时删除数组左半部分仍然可保证有peak element, mid = start;

（3）nums[mid-1] > nums[mid] && nums[mid] > nums[mid+1], 此时删除数组左半部分仍然可保证有peak element,mid = end;

（4）在波谷位置，随意左右均可。

 class Solution {
 public:
     int findPeakElement(vector<int>& nums) {
         int start = , end = nums.size() - ;
         while(start +  < end ){
             int mid = start + (end - start) / ;
             if(nums[mid - ] < nums[mid] && nums[mid] > nums[mid+]){
                 return mid;
             }
             else if(nums[mid - ] < nums[mid] && nums[mid] < nums[mid + ]){
                 start = mid;
             }
             else{
                 end = mid;
             }
         }
         if(nums[start] > nums[end]){
             return start;
         }
         return end;
     }
 };