Two Sum——Array

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

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        nums_sort = sorted(nums)
        left, right = 0, len(nums_sort)-1
        while left < right:
        	sum = nums_sort[left] + nums_sort[right]
        	if sum == target:
        		break
        	elif sum > target:
        		right -= 1
        	else:
        		left += 1

        p1 = nums.index(nums_sort[left])
        p2 = nums.index(nums_sort[right])
        
        if p1 == p2:
        	p2 = nums[p1+1:].index(nums_sort[right]) + p1 + 1

        return [p1, p2]