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].
python
class Solution(object): def twoSum(self,nums, target): for a in range(0, len(nums)): for b in range(0, len(nums)): if (nums[a] + nums[b] == target and a != b): return [a, b]