📌 문제

https://programmers.co.kr/learn/courses/30/lessons/12910

---

📌 접근

• js filter(), sort(), 오름차순정렬, 삼항연산자
• python list filtering, 오름차순정렬 삼항연산자

---

📌 코드

js

처음 작성한 코드

function solution(arr, divisor) {
    const result = [];
    
    for(var i =0; i<arr.length; i++){
        if(arr[i]%divisor == 0) {
            result.push(arr[i]);
        }
    }
    
    if (result.length == 0) {
        result.push(-1)
    }
    
    return result.sort((a,b) => a-b);
    
}

filter()

function solution(arr, divisor) {
    const result = arr.filter(x => x%divisor==0).sort((a,b) => a-b);
    
    return result.length==0 ? [-1] : result;
}

---

python

def solution(arr, divisor):
    result = sorted( [x for x in arr if x%divisor==0] )
    
    return [-1] if len(result)==0 else result

---

✍ 메모