JAVA_LeetCode 162_Find Peak Element 풀이 class Solution { public int findPeakElement(int[] nums) { int left = 0, right = nums.length - 1, mid = 0; while(left < right){ mid = left + (right - left) / 2; if(nums[mid] < nums[mid + 1]) left = mid + 1; // 오른쪽에 peak가 있음 else right = mid; // 왼쪽에 peak가 있음(혹은 mid가 peak) } return left; // left == right가 되는 순간 peak } } * 출처 https://leetcode.com/problems/find-peak-element...
