leetcode练习

一、两数之和#解法1class Solution(object):    def twoSum(self, nums, target):        lens = len(nums)        for i in range(0,lens):            for j in range(i+1,lens):                num1 = nums[i]                num2 = nums[j]                if (num1 + num2 == target):                    # m = nums.index(num1)                    # n = nums.index(num2)                    lis = [i,j]                    return (lis)    twoSum(0,[4,3,2], 5)#解法2class Solution(object):    def twoSum(self, nums, target):        j = -1        lens = len(nums)        for i in range(1,lens):            temp = nums[:i]            if (target - nums[i]) in temp:                j = temp.index(target - nums[i])                break        if j >= 0:            lis = [j,i]            return (lis)    twoSum(0,[4,3,2], 5)

来源：https://www.cnblogs.com/xiaojingjingzhuanshu/p/11539879.html