<qiyuangong>015_3Sum_1.py
def threeSum( nums):
    if len(nums) < 3:
        return []
    nums.sort()
    ls = len(nums)
    result = []
    for i in range(0, ls - 2):
        if nums[i] > 0:
            break
        if i > 0 and nums[i] == nums[i - 1]:
            continue
        j = i + 1
        k = ls - 1
        while(j < k):
            temp = [nums[i], nums[j], nums[k]]
            s = sum(temp)
            jtemp = nums[j]
            ktemp = nums[k]
            if s <= 0:
                j += 1
                while(j < k and jtemp == nums[j]):
                    j += 1
                if s == 0:
                    result.append(temp)
            else:
                k -= 1
                while(j < k and ktemp == nums[k]):
                    k -= 1
    return result
def sample_funcname ( var_0 ) :
    if len ( var_0 ) < 3 :
        return [ ]
    var_0.sort ( )
    var_4 = len ( var_0 )
    var_5 = [ ]
    for var_9 in range ( 0 , var_4 - 2 ) :
        if var_0 [ var_9 ] > 0 :
            break
        if var_9 > 0 and var_0 [ var_9 ] == var_0 [ var_9 - 1 ] :
            continue
        var_11 = var_9 + 1
        var_12 = var_4 - 1
        while ( var_11 < var_12 ) :
            var_13 = [ var_0 [ var_9 ] , var_0 [ var_11 ] , var_0 [ var_12 ] ]
            var_15 = sum ( var_13 )
            var_16 = var_0 [ var_11 ]
            var_17 = var_0 [ var_12 ]
            if var_15 <= 0 :
                var_11 += 1
                while ( var_11 < var_12 and var_16 == var_0 [ var_11 ] ) :
                    var_11 += 1
                if var_15 == 0 :
                    var_5.append ( var_13 )
            else :
                var_12 -= 1
                while ( var_11 < var_12 and var_17 == var_0 [ var_12 ] ) :
                    var_12 -= 1
    return var_5
