（python）leetcode刷题笔记 01 TWO SUM

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

ANSWER：

 1 class Solution(object):
 2     def twoSum(self, nums, target):
 3         """
 4         :type nums: List[int]
 5         :type target: int
 6         :rtype: List[int]
 7         """
 8         for i, v1 in enumerate(nums):
 9             for j, v2 in enumerate(nums[i + 1:]):
10                 if (v1 + v2) == target:
11                         return [i,j+i+1]

ANSWER