[알고리즘] 프로그래머스 - 삼총사

삼총사 

 

 

for문

def solution(number):
    cnt = 0
    for i in range(len(number)-2):
        for j in range(i+1, len(number)-1):
            for k in range(j+1, len(number)):
                if number[i] + number[j] + number[k] == 0:
                    cnt += 1
    return cnt

 

 

itertools.combinations

from itertools import combinations
def solution(number):
    cnt = 0
    c = combinations(number, 3)
    combi_ = list(c)
    for i in combi_:
        if sum(i) == 0:
            cnt +=1
    return cnt