[Leetcode][python]寻找峰值

class Solution(object):
    def findPeakElement(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        left = 0
        right = len(nums)-1
        while left <= right:
            print left, right
            if left == right:
                return left
            mid = left + (right -left) / 2 
            # 如果中间小于右边，那么一定在右边
            if nums[mid] < nums[mid+1]:
                left = mid + 1
            # 左边不小于右边，那么直接把右边弄到中间
            else:
                # right不可以是mid-1，万一正好是mid，就跳过了，因为并没有比对mid的值
                right = mid