[LeetCode] Find Peak Element

The idea and code is just taken from this link. There is a nice explanation to the code on the answer by BrianLuong1337.

class Solution {
public:
    int findPeakElement(vector<int>& nums) {
        int n = nums.size(), l = 0, r = n - 1;
        while (l < r) {
            int m = (l & r) + ((l ^ r) >> 1), mr = m + 1;
            if (nums[m] > nums[mr]) r = m;
            else l = mr;
        }
        return l;
    }
};