1. Two Sum(python3实现）

最新推荐文章于 2023-02-06 10:00:13 发布

原创最新推荐文章于 2023-02-06 10:00:13 发布 · 811 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#easy

python 同时被 3 个专栏收录

6 篇文章

订阅专栏

编程题

3 篇文章

订阅专栏

leetcode

2 篇文章

订阅专栏

本文深入探讨了经典的两数之和算法问题，提供了一种简单直观的解决方案。通过遍历数组，寻找两个数，使它们的和等于给定的目标值。此算法适用于初学者理解和掌握基本的编程技巧。

问题描述：
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: List[int], target: int) -> List[int]:
        for num in nums:
            for index in range(nums.index(num),len(nums)):
                if num+nums[index]==target:
                    return [num,nums[index]]