4.1 練手

Leetcode 1 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].

一开始只用循环暴力解，拿到Time Limit Exceeded，时间复杂度为 O(n^2）

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        result = []
        n = len(nums) 
        for i in range(n-1):
            for j in range(i+1,n):
                if (nums[i]+nums[j]==target) :
                    result.append(i)
                    result.append(j)
        return result
                

问了一下朋友，他告诉我有个index的函数可以解决，同时好像我对exactly one solution 有迷之误解，其实是只有一对的意思（？）

另外发现index函数如果没找到某个值是会直接报错的，最好要和count搭配使用。

以下是代码：

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        result = []
        n = len(nums) 
        for i in range(n):
            if(nums.count(target-nums[i])>0 && nums.index(target-nums[i])!=i):
                result.append(i)
                result.append(nums.index(target-nums[i]))
                break
        return result