[Leetcode] 1. Two Sum

[Leetcode] 1. Two Sum

Problem

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

UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read the above updated description carefully.

思路：
用的暴力枚举法，居然一次通过了。
其他优化方法先挖坑，以后补吧。

Solution :

# -*- coding: utf-8 -*-
"""
Created on Tue Dec 27 10:55:38 2016
@author: liangsht
"""
class Solution(object):
    def twoSum(self,nums,target):
        index = []
        for i in range (0,len(nums)-1):
            for j in range(i+1,len(nums)):
                if(nums[i]+nums[j]==target):
                    index.append(i)
                    index.append(j)
        return index