首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >leetcode: 1. Two Sum

leetcode: 1. Two Sum

作者头像
JNingWei
发布2018-09-28 14:27:57
3010
发布2018-09-28 14:27:57
举报
文章被收录于专栏:JNing的专栏JNing的专栏

Difficulty

Easy.

Problem

# 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

class Solution():
    def twoSum(self, nums, target):
        d = {}
        for i, v in enumerate(nums):
            if v in d:
                return [d[v], i]
            d[target - v] = i

if __name__ == '__main__':
    assert Solution().twoSum([2, 7, 11, 15], 22) == [1, 3]
本文参与 腾讯云自媒体分享计划,分享自作者个人站点/博客。
原始发表:2017年10月28日,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体分享计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
目录
  • Difficulty
  • Problem
  • AC
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档