Python 1. Two Sum_1. two sum python-CSDN博客

本文链接：https://blog.csdn.net/qq_43337384/article/details/119770745

本文探讨了一种解决两数之和问题的高效算法，通过使用哈希表将时间复杂度降低到O(n)，避免了暴力求解的O(n^2)复杂度。首先尝试了简单的双重循环实现，然后优化为利用哈希表存储数组元素及其索引，通过目标值减去已遍历的元素来查找匹配项，从而快速找到答案。这种方法在解决这类问题时更为高效。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

You can return the answer in any order.

Example 1:

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].
Example 2:

Input: nums = [3,2,4], target = 6
Output: [1,2]
Example 3:

Input: nums = [3,3], target = 6
Output: [0,1]

Constraints:

2 <= nums.length <= 104
-109 <= nums[i] <= 109
-109 <= target <= 109
Only one valid answer exists.

Follow-up: Can you come up with an algorithm that is less than O(n2) time complexity?

Ideas of solving a problem

At the beginning I chose to use the simplest double for statement, and get the result by adding the numbers in the array in order. The program can run successfully, and the resulting time complexity is O (n^2).

The Code Is Here。

def twoSum(self, nums, target):
    """
    :type nums: List[int]
    :type target: int
    :rtype: List[int]
    """
    length=len(nums)
    for i in range(0,length):
        for j in range(i+1,length):
            if nums[i]+nums[j] ==target:
                return [i,j]

After that, I thought about completing the project with a time complexity of O (n). So I consider using target to minus the original list. When I get the new list, I compare the two lists to see if they have the same elements and if they have different coordinates (index). However, the answers I get here are in reverse order. So I reorder the answers using the sort function.
The Code Is Here。

def TwoSum(self,nums,target):
    lst=[ target-i for i in nums ]
    for i in range(0,len(nums)):
        if nums[i] in lst and i!=lst.index(nums[i]):
            list=[i,lst.index(nums[i])]
            list2=sorted(list)
            return list2