题目描述:

leetcood学习笔记-167-两数之和 II - 输入有序数组

第一次提交:

class Solution(object):
    def twoSum(self, numbers, target):
        """
        :type numbers: List[int]
        :type target: int
        :rtype: List[int]
        """
        a = 0
        b = len(numbers)-1
        
        while a != b:
            sum = numbers[a] + numbers[b]
            if sum > target:
                b -= 1
            elif sum < target:
                a += 1
            elif sum == target:
                return a+1,b+1
        return None

注:此方法超时:

class Solution(object):
    def twoSum(self, numbers, target):
        """
        :type numbers: List[int]
        :type target: int
        :rtype: List[int]
        """
        res=[]
        for i in range(len(numbers)):

            if (target-numbers[i]) in numbers[i+1:]:
                res.append(i+1)
                res.append(numbers[i+1:].index(target-numbers[i])+1+i+1)
                break
        return res  

 

 

 

 

---恢复内容结束---

相关文章:

  • 2022-12-23
  • 2021-11-18
  • 2021-08-24
  • 2021-08-16
  • 2021-09-14
  • 2021-10-23
  • 2021-11-09
猜你喜欢
  • 2021-06-10
  • 2021-12-14
  • 2021-10-11
  • 2021-07-13
相关资源
相似解决方案