Leetcode01

o1-twoSum

题目描述

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].
输入一个数组和target，要在一个数组中找到两个数字，其和为target，从小到大输出数组中两个数字的位置。题目中假设有且仅有一个答案

解决思路

方法1.循环嵌套，时间复杂度是O(n*n)

class Solution:
    def twoSum(nums,target):
        for i in range(len(nums)):
            for j in range(i+1,len(nums)):
                if nums[i]+nums[j] == target:
                    return [i,j]
                    

方法2.使用字典，时间复杂度是O(n)

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        d = {}#键是nums中的值，值是nums中的坐标
        for i, num in enumerate(nums):
            if target - num in d: #如果taget-num是字典d的键
                return [d[target - num], i] #返回字典d的值，和nums的坐标
            d[num] = i #如果不是，则将索引添加到字典d中的值

其中enumerate()的用法参考
https://blog.csdn.net/LiShuanlalala/article/details/88734087