python练习——34_Leetcode

我的解答:

1.

def searchRange(nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """		
		answer = []
        flag = 0
        if len(nums) == 1:
            if nums[0] == target:
                flag = 1
                answer = [0,0]
        for i in range(0,len(nums)-1):
            if nums[i] == target and flag == 0:
                flag = 1
                answer.append(i)
            if nums[i] == target and nums[i+1] != target :
                answer.append(i)
            if nums[i] == target and nums[i+1] == target and i+2 == len(nums) :
                answer.append(i+1)
        if len(nums) >1 and nums[len(nums)-1] == target and nums[len(nums)-2] != target:
            flag = 1
            answer = [len(nums)-1,len(nums)-1]
        if flag == 0:
            answer = [-1,-1]
        return answer



2.

def searchRange(nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        answer = []
        flag = 0
        i = 0
        for i in range(0,len(nums)):
            if nums[i] == target:
                flag = 1
                answer.append(i)
                break

        print(str(i)+'\n')
        for j in range(i+1,len(nums)):
            if nums[j] > target:
                flag = 2
                answer.append(j-1)
                break
            if j == len(nums)-1 and nums[j] == target:
                flag = 2
                answer.append(j)
                break
        print(str(j)+'\n')        
        if flag == 0:
            answer = [-1,-1]
        elif flag == 1:
            answer.append(i)
            
        return answer
        

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值