leetcode : Two Sum

题目:Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

思路：开始拿到这一题以为很简单，就简单的两层遍历就好了，没想到超时了，好吧这又是一道拿空间换时间的算法题，我的解题思想就是拷贝到新的数组排序，从两头开始遍历。代码如下：

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        import copy
        
        index = []
        box = copy.deepcopy(nums)
        
        box.sort()
        boxlen = len(box)
        
        i = 0
        j = boxlen - 1
        while i <= j:
            if box[i] + box[j] == target:
                index.append(nums.index(box[i]) + 1)
                if box[i] == box[j]:
                    index.append(nums.index(box[j],nums.index(box[i]) + 1) + 1)
                else:
                    index.append(nums.index(box[j]) + 1)
                index.sort()
                return index
            elif box[i] + box[j] < target:
                i += 1
            else:
                j -=1
                
        return index