LeetCode 1.Two Sum （Python）

最新推荐文章于 2024-04-14 11:28:50 发布

原创最新推荐文章于 2024-04-14 11:28:50 发布 · 324 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#python #leetcode

LeetCode-P 专栏收录该内容

22 篇文章

订阅专栏

本文解析了一道经典算法题“两数之和”，题目要求在整数数组中找到两个数，使它们的和等于特定的目标数。文章提供了一个Python实现的高效解法，并附带详细的代码解释。

题目描述：
Given an array of integers, return indices of the two numbers such that they add up to a specific target.

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

Example:
Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9, return [0, 1].

AC代码Python版：

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]

        更优秀的解 O（n）
        tmp_num = {}
        for i in range(len(nums)):
            if target - nums[i] in tmp_num:
                # here do not need to deal with the condition i = target-i
                return (tmp_num[target-nums[i]], i)
            else:
                tmp_num[nums[i]] = i
        return (-1, -1)  """

        result = []
        isA = True
        for i in range(len(nums)):
            for j in range(i + 1, len(nums)):
                if nums[i] + nums[j] == target:
                    result.append(i)
                    result.append(j)
                    isA = False
                    break
            if isA is False:
                break
        return result