class Solution(object):
def twoSum( self,nums, target):
j = len(nums) - 1
while j >= 0:
i = len(nums) - 1
while (i >= 0):
if (nums[j] + nums[i] == target) and i!=j:
if(j<i):
return [j, i]
else:
return [i,j]
else:
i = i - 1
j = j - 1