@@ -0,0 +1,562 @@
+package leetcode;%0A%0A/**%0A * https://leetcode.com/problems/find-peak-element/%0A */%0Apublic class Problem162 %7B%0A    public int findPeakElement(int%5B%5D num) %7B%0A        return findPeakElement(num, num.length-1, 0);%0A    %7D%0A    %0A    private int findPeakElement(int%5B%5D num, int left, int right) %7B%0A        if (right %3E= left) %7B%0A            return right;%0A        %7D%0A        int mid = (left + right) / 2;%0A        if (num%5Bmid%5D %3C num%5Bmid+1%5D) %7B%0A            return findPeakElement(num, left, mid+1);%0A        %7D else %7B%0A            return findPeakElement(num, mid, right);%0A        %7D%0A    %7D%0A%7D%0A

Solve problem 162