dev-note

def solution(n): answer = 0 n = list(map(int, str(n))) n.sort(reverse=True) n = ''.join(map(str, n)) n = int(n) return n * 기억할 거 숫자 뭉치를 숫자형 list로 바꾸고 , reverse 한다음 , str로 바꾸고, int로 바꾸기

def solution(arr, divisor): a = [] for i in range(len(arr)): if arr[i] % divisor == 0: a.append(arr[i]) a.sort() if len(a) == 0: a = [-1] return a * 기억할 거 for문 다 돌고 if 문 들어와서 len(a)로 판단하고 -1 append하기!!

def solution (array, commands): answer= [] for command in commands: i,j,k = command[0], command[1], command[2] a = array[i-1: j] a.sort() answer.append(a[k-1]) return answer

def solution(arr): answer = [] for i in arr: if answer[-1:] == [i]: continue answer.append(i) return answer

def solution(s): if len(s) % 2 != 0: return s[len(s)//2] else: return s[len(s)//2 -1 : len(s)//2 +1]

def solution(s): s = s.lower() s = list(s) if s.count('p') == s.count('y'): return True elif s.count('p') == 0 and s.count('y') == 0: return True else: return False

def solution(n): answer= '' for i in range(n): if i % 2 == 0: answer += '수' else: answer += '박' return answer

def solution(s, n): lower_list = "abcdefghijklmnopqrstuvwxyz" upper_list = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" result = [] for i in s: if i is " ": result.append(" ") elif i.islower() is True: new = lower_list.find(i) + n result.append(lower_list[new % 26]) else: new = upper_list.find(i) + n result.append(upper_list[new % 26]) return "".join(result)

def solution(n): answer = [] for i in range(1, n+1): if n % i == 0: answer.append(i) return sum(answer)

def solution(n): num = set(range(2,n+1)) for i in range(2,n+1) : if i in num : num -= set(range(2*i, n+1, i)) return len(num)