LeetCodeOJ：1Two Sum

最新推荐文章于 2018-05-24 10:11:32 发布

jxfang7788

最新推荐文章于 2018-05-24 10:11:32 发布

阅读量369

点赞数

分类专栏： python OJ 文章标签： LeetCode OJ python

本文链接：https://blog.csdn.net/fjx1173865548/article/details/50936243

版权

OJ 同时被 2 个专栏收录

107 篇文章 0 订阅

订阅专栏

python

21 篇文章 0 订阅

订阅专栏

Total Accepted: 203765 Total Submissions: 923425 Difficulty: Easy

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

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        index = {}
        for i, num in enumerate(nums):
            if target - num in index:
                return [index[target - num], i]
            index[num] = i

关于enumerate函数的用法：