leetcode -Two Sum

最新推荐文章于 2024-10-16 10:13:45 发布

little_zozo

最新推荐文章于 2024-10-16 10:13:45 发布

阅读量177

点赞数 1

分类专栏： leetcode 文章标签： leetcode 算法 python

本文链接：https://blog.csdn.net/weixin_46995523/article/details/106465083

版权

leetcode 专栏收录该内容

4 篇文章 0 订阅

订阅专栏

问题描述

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

mycode

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

Runtime: 1120 ms
Memory Usage: 14.7 MB
捂脸哭