leetCode练习（162）

题目：Find Peak Element

难度：medium

问题描述：

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

Given an input array nums, where nums[i] ≠ nums[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 nums[-1] = nums[n] = -∞.

解题思路：

方案一：从左到右遍历
方案二：二分搜索
  *   如果nums[i]<nums[i+1] 则[i+1,n]一定有peak，即使完全递增，n[n]也是peak
  *   如果nums[i]>nums[i+1] 则[0,i]一定有peak，同理

代码如下：

//顺序遍历
	public int findPeakElement1(int[] nums) {
        int pre = Integer.MIN_VALUE;
        int index = 0;
        boolean preCon =false;
        while(index<nums.length){
        	int v = nums[index];
        	if(v>pre){
        		preCon = true;
        	}else if(v<pre){
        		if(preCon) return index-1;
        	}
        	pre = v;
        	index++;
        }
        return nums.length-1;
    }
	//二分搜索
	public int findPeakElement2(int[] nums) {
		if(nums.length==1) return 0;
		int p1=0,p2=nums.length-1;
		int mid = 0;
		while(p1<p2){
			mid = (p1+p2)>>1;
			if(nums[mid]<nums[mid+1]){
				p1 = mid+1;
				continue;
			}else{
				p2 = mid;
				continue;
			}
		}
		return p1;
    }