https://leetcode.com/problems/search-in-rotated-sorted-array-ii/

https://leetcode.com/problems/search-in-rotated-sorted-array-ii/

和上一题没有区别 把值改成TF

class Solution:    # @param {integer[]} nums    # @param {integer} target    # @return {boolean}    def search(self, nums, target):        for i in range(len(nums)-1):            if nums[i]>nums[i+1]:                startindex=len(nums)-1-i                nums=nums[i+1:]+nums[:i+1]        #nums is sorted        s=0        e=len(nums)-1        if target<nums[0] or target>nums[-1]:            return False        if target==nums[-1] or  target==nums[0]:            return True        while s!=e-1:            if nums[(e+s)/2]>target:                e=(e+s)/2            elif nums[(e+s)/2]<target:                s=(e+s)/2            else:                return True        return False