https://programmers.co.kr/learn/courses/30/lessons/68644
def solution(numbers):
answer = []
for i in range(0,len(numbers)-1):
for j in range(i+1,len(numbers)):
s=numbers[i]+numbers[j]
if s not in answer:
answer.append(s)
answer.sort()
return answer
def solution(numbers):
answer = []
for i in range(0,len(numbers)):
for j in range(i+1,len(numbers)):
answer.append(numbers[i]+numbers[j])
answer=sorted(list(set(answer)))
return answer
두 번째 코드가 몇 개의 테스트 케이스에서 더 빠른 속도를 가짐