Two Sum [leetcode 1]

最新推荐文章于 2021-12-16 21:15:08 发布

不迷信_只迷人

最新推荐文章于 2021-12-16 21:15:08 发布

阅读量611

点赞数

CC 4.0 BY-SA版权

分类专栏： Python 学习算法练习

本文链接：https://blog.youkuaiyun.com/honeyaya/article/details/50762018

算法练习同时被 2 个专栏收录

141 篇文章

订阅专栏

Python 学习

31 篇文章

订阅专栏

本文提供了一个解决LeetCode经典题目“两数之和”的Python实现方案。通过双重循环遍历数组寻找两个数相加等于目标值的索引。

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

链接：https://leetcode.com/problems/two-sum/

1. Two Sum

My Submissions

Total Accepted: 192702 Total Submissions: 898652 Difficulty: Medium

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.

Example:

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

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

UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read the above updated description carefully.

Subscribe to see which companies asked this question

Show Tags

Show Similar Problems

主要是为了练习python

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        
        for i,num1 in enumerate(nums):
            for j,num2 in enumerate(nums):
                if j > i :
                    if num1 + num2 == target:
                        return i,j

Send Feedback