Leetcode 之 Two Sum

2017-11-07  本文已影响0人  nkuhero
class Solution:
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        result = {}
        for i in range(len(nums)):
            if target - nums[i] not in result:
                result[nums[i]] = i
            else:
                return [result[target - nums[i]], i]
        return [-1, -1]
上一篇 下一篇

猜你喜欢

热点阅读