LeetCode1 Two Sum

记录一下刷LeetCode~

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

Python解法：

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        if len(nums) <= 1:
            return False
        #解法1
        #buff_dict = {}//使用字典存储遍历过的num和对应下标{num:index}
        #for i in range(len(nums)):
            #if nums[i] in buff_dict:
                #return [buff_dict[nums[i]], i]
            #else:
                #buff_dict[target - nums[i]] = i
        #解法2
        for i in range(len(nums)):  //最一般的解法
            for j in range(i+1, len(nums)):  
                if(nums[i] + nums[j] == target):  
                    return [i, j]