leetcode 1. Two Sum

标签：number   not   res   odi   solution   [1]   ice   NPU   because   

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这部分，所以只能暂时这样写。以后会完善的。

leetcode 1. Two Sum

标签：number   not   res   odi   solution   [1]   ice   NPU   because   

原文地址：https://www.cnblogs.com/asi2662/p/10177836.html