Leet Code OJ 1. Two Sum [Difficulty: Easy]

题目：
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.

Example:
Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

翻译：
给定一个整形数组和一个整数target，返回2个元素的下标，它们满足相加的和为target。
你可以假定每个输入，都会恰好有一个满足条件的返回结果。
C#:
public int[] RetTwonum(int[] num,int target)
{
int[] result = new int[2];
for (int i = 0; i < num.Length; i++)
{
for (int j = i+1; j < num.Length - 1; j++)
{
if (target == num[i] + num[j])
{
//result =new int[] {i,j };
result[0] = i;
result[1] = j;
}
}
}
return result;
}

python :(2种，这块参考了其他的博客)
”’
class Solution(object) :
def twoSum(self,nums,target):
for i in range(len(nums)):
for j in range(i+1,len(nums)):
if nums[i]+nums[j]==target:
return i,j
”’
class Solution1(object) :
def twoSum(self,nums,target):
dict = {}
for i in range(len(nums)):
x = nums[i]
if target - x in dict:
return (dict[target - x],i)
dict[x] = i
a=Solution1()
nums = [0,2,4,0]
target = 0
print(a.twoSum(nums,target))