【LeetCode】【refine 1】题号:1. 两数之和

every blog every motto: You will never know unless you try

0. 前言

改变策略

1. 正文

1.1 题目

在这里插入图片描述

1.2 代码

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        com_list = [target - i for i in nums]
        # print(com_list)

        ind_list = []
        for c_i, c in enumerate(com_list):

            if c in nums and c_i != nums.index(c):
                ind_list.append(nums.index(c))
                nums[nums.index(c)] = None  # 防止两数相同
                ind_list.append(nums.index(target - c))

                return ind_list

1.3 结果

在这里插入图片描述

Guess you like

Origin blog.csdn.net/weixin_39190382/article/details/119845551