PythonCodeExamples/TwoSum.py at main · UtpalMattoo/PythonCodeExamples · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
# Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target

class Solution(object):
    def twoSum(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        if not (2 <= len(nums) <= 10000):
            assert 2 <= len(nums) <= 10000, "wrong length"

        if not (pow(-10,9) <= target <= pow(10,9)):
            assert pow(-10,9) <= target <= pow(10,9), "target check passed"

        for index, val in enumerate(nums):
            if not (pow(-10, 9) <= nums[index] <= pow(10, 9)):
                assert pow(-10, 9) <= nums[index] <= pow(10, 9), "Invalid value found in nums"

        lst = []
        found = False

        for index1, val1 in enumerate(nums):
            if (found == False):
                lst = []
                lst.append(index1)
                if (found==False):
                   for index2, val2 in enumerate(nums):
                        if index2 != index1:
                            if ((val1 + val2) == target):
                                print ("val1: {}; val2: {}".format(val1, val2))
                                found = True
                                lst.append(index2)

        return lst


test_class = Solution()
nums = [2,7,11,15]
target = 9
val = test_class.twoSum(nums, target)
print (val)