leetcode01

"""
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 (object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        n=len(nums)
        for i in range(0,n):
            for j in range(i,n):
                if i!=j and (nums[i]+nums[j])==target:
                    return [i,j]
if __name__ == "__main__":
    solution = Solution()
    print(solution.twoSum([0,4,3,0],0))