Find Peak Element LeetCode solution in Python

1
class Solution(object):
2
    def findPeakElement(self, nums):
3
        """
4
        :type nums: List[int]
5
        :rtype: int
6
        """
7
        nums = [-(2**32)] + nums + [-(2**32)]
8
        l, r = 0, len(nums) - 1
9
        while l <= r:
10
            m = (l + r) // 2
11
            # we find the target:
12
            if nums[m] > nums[m - 1] and nums[m] > nums[m + 1]:
13
                return m - 1
14
            else:
15
                if nums[m] < nums[m + 1]:
16
                    l = m + 1
17
                else:
18
                    r = m - 1
19
        return -1