Description
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
class Solution: def twoSum(self, nums, target): """ :type nums: List[int] :type target: int :rtype: List[int] """ size = len(nums) - 1 reversed_nums = nums[::-1] result_list = [ target - x for x in nums] for result in result_list: if result in nums and nums.count(result) == 1 and result_list.index(result) != nums.index(result): return [result_list.index(result), nums.index(result)] if result in nums and nums.count(result) > 1: return [result_list.index(result), size - reversed_nums.index(result)] return None