#162 Find Peak Element.java

//https://leetcode.com/problems/find-peak-element/
class Solution {
    public int findPeakElement(int[] nums) {
        
        for(int i = 1 ; i < nums.length - 1 ; i++) {
            if(nums[i] > nums[i-1] && nums[i] > nums[i+1]) {
                return i;
            }
        }
        if(nums.length >= 2 && nums[0] > nums[1]) return 0;
        if(nums.length >= 2 &&nums[nums.length - 2] < nums[nums.length-1]) return  nums.length -1;
        if(nums.length == 1) return  0;
        return 0;
    }
}