프로그래머스 level1 나누어 떨어지는 숫자 배열

 

def solution(arr, divisor):
    answer = []
    for index in arr:
        if index%divisor==0
            answer.append(index)
    answer.sort()        
    if len(answer)==0:# 안에 아무것도 없다면 
        answer=-1
    return answer

=>

def solution(arr, divisor):
    answer = [i for i in arr if i % divisor == 0];
    answer.sort();
    return answer if len(answer) != 0 else [-1];

==>

def solution(arr, divisor): 
	return sorted([n for n in arr if n%divisor == 0]) or [-1]

https://wikidocs.net/22211