Python实现leetcode 1.两数之和

最新推荐文章于 2020-11-26 10:37:34 发布

毒吻可积

最新推荐文章于 2020-11-26 10:37:34 发布

阅读量337

点赞数

分类专栏： leetcode 文章标签： python leetcode

本文链接：https://blog.csdn.net/laicikankna/article/details/104108525

版权

leetcode 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

这篇博客介绍了如何使用Python解决LeetCode中的两数之和问题。首先，作者展示了初始的暴力求解方法，即遍历数组寻找配对，但这种方法效率低下。接着，通过提示，作者提出了改进方案，利用额外的空间如哈希映射加快搜索速度，从而优化了算法的时间复杂度。

摘要由CSDN通过智能技术生成

题目

传送门：此题链接https://leetcode-cn.com/problems/two-sum/

初解

一拿到就是比较无脑的死算，从前往后先选定一个数字再凑一凑，看看其和是不是所期望的和。
提示1：A really brute force way would be to search for all possible pairs of numbers but that would be too slow. Again, it’s best to try out brute force solutions for just for completeness. It is from these brute force solutions that you can come up with optimizations.

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        for i in range(len(nums)):
            for j in range(i+1, len(nums)):
                while nums[i] + nums[j] == target:
                    return ([i,j])

比较无脑的暴力算法，初解的效果很一般，尤其是用时（程序时间复杂度是 O(n^2)）。初解效果

更好的解答

根据更多的提示，进一步改善。
提示2：So, if we fix one of the numbers, say x, we have to scan the entire array to find the next number y ，which is value - x ，where value is the input parameter. Can we change our array somehow so that this search becomes faster?
提示3：The second train of thought is, without changing the array, can we use additional space somehow? Like maybe a hash map to speed up the search?

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        keys={}
        for index,num in enumerate(nums):
            if target-num in keys:
                return [index,keys[target-num]]
            keys[num]=index