167. Two Sum II - Input Array Is Sorted刷题笔记

最新推荐文章于 2024-06-29 10:15:27 发布

waiting不是违停

最新推荐文章于 2024-06-29 10:15:27 发布

阅读量65

点赞数

分类专栏： tensor python 文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/weixin_44737922/article/details/125197509

版权

tensor python 专栏收录该内容

12 篇文章 6 订阅

订阅专栏

初版代码超时，因为遇到一堆很多重复序列

class Solution:
    def twoSum(self, numbers: List[int], target: int) -> List[int]:
        for i in range(len(numbers)-1):
            diff = target-numbers[i]
            for j in range(i+1,len(numbers)):
                if numbers[j] == diff:
                    return [i+1,j+1]
                elif numbers[j] >diff:
                    break

因此加上剪枝判断之后，就通过了

class Solution:
    def twoSum(self, numbers: List[int], target: int) -> List[int]:

        for i in range(len(numbers)-1):
            if i > 0 and numbers[i] == numbers[i-1]:
                continue
            diff = target-numbers[i]
            for j in range(i+1,len(numbers)):
                if j > i+2 and numbers[j] == numbers[j-1]:
                    continue
                
                if numbers[j] == diff:
                    return [i+1,j+1]
                elif numbers[j] >diff:
                    break