Nsryjdtyk

I tried to solve the 3Sum problem in leetcodes

Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.

Note:

The solution set must not contain duplicate triplets.

Example:

Given array nums = [-1, 0, 1, 2, -1, -4],



A solution set is:

[

  [-1, 0, 1],

  [-1, -1, 2]

]

and my running codes

class Solution:

    def threeSum(self, nums, target: int=0) -> List[List[int]]:

        """

        :type nums: List[int]

        :type target: int 

        """

        if len(nums) < 3: return 



        lookup = {nums[i]:i for i in range(len(nums)-1, -1, -1)} #overwrite from the high

        triplets = 

        triplets_set = set()



        for i in range(len(nums)):

            num_1 = nums[i]

            sub_target = target - num_1

            # logging.debug(f"level_1_lookup: {lookup}")



            for j in range(i+1, len(nums)):

                num_2 = nums[j] 

                _j = lookup[num_2] 

                _i = lookup[num_1]

                _k = j + 1



                num_3 = sub_target - num_2              

                k = lookup.get(num_3) #             



                if k not in {None, i, j}: #don't reproduce itself  

                    if num_1 == num_2 == num_3 == 0: 

                        t = (0, 0, 0)

                        triplets_set.add(t) 

                        #logging.debug(f"i {i}:{_i}, j {j}:{_j}, k {k}: {_k}")



                    if i != _i and j != _j and k != _k: continue #remove the identical copies 



                    result = [num_1, num_2, num_3]

                    result.sort()

                    result = tuple(result)

                    triplets_set.add(result)



                    # logging.debug(f"j: {j}, _j: {_j}, k: {k}")

                    # logging.debug(f"lookup: {lookup} sub_nums: {nums[j:]} nresult: {result}")

                    # logging.info(f"ttriplets: {triplets}nnnn")  



        triplets = [list(t) for t in triplets_set]

        return triplets 

As for the ports

                if k not in {None, i, j}: #don't reproduce itself  

                    if num_1 == num_2 == num_3 == 0: 

                        t = (0, 0, 0)

                        triplets_set.add(t) 

it produce a last result

[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,00,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]

I cannot figure out what's the problem with my usage of tuple and set?