Update 0162-find-peak-element.java

The java code for this problem is missing. So I added my code which passed the testcases on leetcode.

submission link: https://leetcode.com/problems/find-peak-element/submissions/1135183935/

java/0162-find-peak-element.java

@@ -0,0 +1,14 @@
+class Solution {
+ public int findPeakElement(int[] nums) {
+ int l = 0, r = nums.length-1;
+ while(l<=r){
+ int m = l + (r-l)/2;
+ int left = (m-1==-1)?Integer.MIN_VALUE:nums[m-1];
+ int right = (m+1==nums.length)?Integer.MIN_VALUE:nums[m+1];
+ if(nums[m]>left && nums[m]>right) return m;
+ else if(nums[m]<left) r=m-1;
+ else l = m+1;
+ }
+ return 0;
+ }
+}