Simple Java Solution


  • 0
    Z
    public class Solution {
        public int findPeakElement(int[] nums) {
            for (int i = 0; i < nums.length-1; i++) {
                if(nums[i] > nums[i+1]){
                    return i;
                }
            }
    
            return nums.length-1;
        }
    }
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.