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

 

#encoding=utf-8

def twoSum(nums, target):
result=0
a=[]
for i in range(len(nums)):
result=target-nums[i]
if result in nums and nums[i] not in a and result not in a:
a.append(nums[i])
a.append(result)
print(a)


twoSum([2,7,11,15],9)
twoSum([2,7,3,3,11,15],6)
twoSum([2,3,7,3,11,15],6)
twoSum([1,2,5,6,11,15],7)
twoSum([1,2,3,5,7,3,11,15],6)

 

暂时还没学到class这部分,所以只能暂时这样写。以后会完善的。

转载于:https://www.cnblogs.com/asi2662/p/10177836.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值