（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 = [, , , ], target = ,

Because nums[] + nums[] =  +  = ,
return [, ].

ANSWER：

 class Solution(object):
     def twoSum(self, nums, target):
         """
         :type nums: List[int]
         :type target: int
         :rtype: List[int]
         """
         for i, v1 in enumerate(nums):
             for j, v2 in enumerate(nums[i + :]):
                 if (v1 + v2) == target:
                         return [i,j+i+]

ANSWER