首页 > itarticle > 1 two sum

1 two sum

admin 11月 14, 2020 0

Description

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.

My Solution

Python


class (object):
def twoSum(self, nums, target):
    """
    :type nums: List[int]
    :type target: int
    :rtype: List[int]
    """
    result = []
    for index1, int1 in enumerate(nums):
        int2 = target-int1
        if (int2 in nums):
            index2 = nums.index(int2) 
            if int1 != int2 or index1 != index2:
                result.append(index1)
                result.append(index2)
                break
            else:
                continue
        else:
            continue
    return result

想法：暴力解法

Best Solution

Python

# 使用了字典，相当于hash
def twoSum(self, nums, target):
    d = {}
    for i, n in enumerate(nums):
        m = target - n
        if m in d:
            return [d[m], i]
        else:
            d[n] = i

想法：
1. 使用字典
2. enumerate()