Letcode python刷题日记 第一天

Letcode python刷题日记 第一天

为了不荒废代码，每天练练

1. Two Sum

难度简单13122收藏分享切换为中文接收动态反馈

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

You may assume that each input would have *exactly* one solution, and you may not use the same element twice.

You can return the answer in any order.

Example 1:

Input: nums = [2,7,11,15], target = 9
Output: [0,1]
Output: Because nums[0] + nums[1] == 9, we return [0, 1].

Example 2:

Input: nums = [3,2,4], target = 6
Output: [1,2]

Example 3:

Input: nums = [3,3], target = 6
Output: [0,1]

Constraints:

• 2 <= nums.length <= 104
• -109 <= nums[i] <= 109
• -109 <= target <= 109
• Only one valid answer exists.

Follow-up: Can you come up with an algorithm that is less than O(n2)time complexity?

通过次数2,846,575

提交次数5,447,992

本题核心思想是，如何能快速遍历（除了暴力搜索），python提供了字典允许这个操作，本质就是在已生成的键值寻找（查找问题），只要能将被寻找值用已生成值表示就可以,如：sub = target - value

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        dic = dict()
        for index, value in enumerate(nums):
            sub = target - value
            if sub in dic:
                return [dic[sub], index]
            else:
                dic[value] = index