Leetcode 33 Search in Rotated Sorted Array

来源:互联网 发布:魔兽6.2数据库 编辑:程序博客网 时间:2024/05/18 02:30



class Solution:    # @param {integer[]} nums    # @param {integer} target    # @return {integer}    def search(self, nums, target):        for i in xrange(len(nums)):            if nums[i]==target:                return i        return -1


二分法:

class Solution:    # @param {integer[]} nums    # @param {integer} target    # @return {integer}    def search(self, nums, target):        left,right=0, len(nums)-1        while left <= right:            mid=(left + right)/2            if nums[mid] == target:                return mid            if nums[left] <= nums[mid]:                if nums[left] <= target < nums[mid]:                    right = mid-1                else:                    left = mid+1            else:                if nums[mid] < target <= nums[right]:                    left = mid+1                else:                    right = mid-1        return -1


0 0
原创粉丝点击