Method threeSum

Array/ThreeSum.py:45–170

:type nums: List[int] :rtype: List[List[int]]

(self, nums)

class Solution(object):
        
    def threeSum(self, nums):
        """
        :type nums: List[int]
        :rtype: List[List[int]]
        """

        sortedNums = nums
        result = []
        index_dict = {}
        for i, d in enumerate(sortedNums):
            try:
                index_dict[d].append(i)
            except KeyError:
                index_dict[d] = [i]
        
        sortedNums = sorted(set(sortedNums))

        length = len(sortedNums) - 1
        result = []
        for i, data in enumerate(sortedNums):
            if data > 0:
                break
            target = 0 - data
            start = i + 1
            end = length
            while start < end:
                if sortedNums[start] + sortedNums[end] == target:
                    # print(target)
                    result.append(sorted((sortedNums[start], sortedNums[end], data)))
                    # break
                    end -= 1
                    start += 1
                    continue

                if sortedNums[start] + sortedNums[end] > target:
                    end -= 1
                else:
                    start += 1

        for i in index_dict:
            if i == 0:
                if len(index_dict.get(i)) >= 3:
                    result.append([0, 0, 0])
                    continue

            if len(index_dict.get(i)) >= 2 and i != 0:
                if index_dict.get(-2*i):
                    result.append(sorted((i,i,-2*i)))


        return result
            # for j in range(i+1, length):
                # pass
                # target = j - data
                # (data, sortedNums[j], target-sortedNums[j])
                # x = self.binarySearch(sortedNums, target, j+1)

                # if x: