Leetcode||34. Search for a Range

Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.

Your algorithm's runtime complexity must be in the order of O(log n).

If the target is not found in the array, return [-1, -1].

For example,
Given [5, 7, 7, 8, 8, 10] and target value 8,
return [3, 4].

实话实话，给的例子很好，根据题意要时间复杂度O(log n)，所以二分查找依旧比较适合，算是33题的变种

class Solution(object):
    def searchRange(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        left = 0
    	right = len(nums) - 1
    	res = [-1, -1]
    	while left <= right:
    		mid = (left + right) / 2
    		if nums[mid] > target:
    			right = mid - 1
    		elif nums[mid] < target:
    			left = mid + 1
    		else:
    			res[0] = mid
    			res[1] = mid
    			i = mid - 1
    			while i>= 0 and nums[i] == target:
    				res[0] = i
    				i -= 1
    			i = mid + 1
    			while i < len(nums) and nums[i] == target:
    			 	res[1] = i
    			 	i += 1
    			break
    	return res