【LintCode 简单】457. 经典二分查找问题

[1, 2, 2, 4, 5, 5]

2

5

6

class Solution:
"""
@param: nums: An integer array sorted in ascending order
@param: target: An integer
@return: An integer
"""
def findPosition(self, nums, target):
# write your code here
length=len(nums)
end=length-1
start=0
mid=(end-start)/2
while start<end:
if target<nums[mid]:
end=mid-1
mid=(end-start)/2
elif target>nums[mid]:
start=mid+1
mid=(end+start)/2
else:
return mid
return -1