25 Tue

๋‚˜๋ˆ„์–ด ๋–จ์–ด์ง€๋Š” ์ˆซ์ž ๋ฐฐ์—ด

'''
https://programmers.co.kr/learn/courses/30/lessons/12910
๋‚˜๋ˆ„์–ด ๋–จ์–ด์ง€๋Š” ์ˆซ์ž ๋ฐฐ์—ด
[ํ’€์ด]
0. ๋‚˜๋จธ์ง€๊ฐ€ 0 ์ธ ์ˆ˜ ์ฐพ๊ธฐ
1. divmod ์‚ฌ์šฉ
'''
def solution(arr, divisor):
    answer = [i for i in sorted(arr) if divmod(i, divisor)[1] == 0]
    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]
len == 0 ์„ ๋น„๊ตํ•  ๋•Œ๋Š” if else ๋Œ€์‹  False or True ๋ฅผ ์ด์šฉํ•  ์ˆ˜ ์žˆ์Œ
'''

Last updated

Was this helpful?