My java solution without binary search


  • -3
    S

    public class Solution {

    public int findPeakElement(int[] nums) {
        
        if(nums.length<2) {
            return 0;
        }
        
        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.