LeetCode - 001

咸鱼学Python

发布于 2019-06-03 15:52:46

4220

发布于 2019-06-03 15:52:46

文章被收录于专栏：咸鱼学Python

原题

https://leetcode.com/problems/two-sum

题干

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]        """        for i in range(len(nums)):          for j in range(i+1, len(nums)):            if nums[i] + nums[j] == target:              return i,j

解

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

本文参与腾讯云自媒体同步曝光计划，分享自微信公众号。

原始发表：2019-05-10，如有侵权请联系 cloudcommunity@tencent.com 删除

add