W8-C1 作业

最新推荐文章于 2025-08-20 18:26:37 发布

原创最新推荐文章于 2025-08-20 18:26:37 发布 · 199 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#作业

作业专栏收录该内容

20 篇文章

订阅专栏

本文解析了一道经典算法题“两数之和”，题目要求从整数数组中找出两个数，使得它们的和等于特定的目标数。文章提供了一个简单易懂的Python实现方案，并附带详细的代码注释。

题号：1

题目要求：

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].

代码：

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