sohodor

def solution(numLog): answer = list() for index in range(1,len(numLog)): compare = str(numLog[index] - numLog[index-1]) if compare == '1': answer.append('w') if compare == '-1': answer.append('s') if compare == '10': answer.append('d') if compare == '-10': answer.append('a') return ''.join(answer)

programmers 2023. 7. 25. 13:20

def solution(n, control): answer = n for c in control: if c == 'w': answer += 1 if c == 's': answer += -1 if c == 'd': answer += 10 if c == 'a': answer -= 10 return answer

programmers 2023. 7. 25. 13:19

def solution(num_list): answer = [] if num_list[-1] > num_list[-2]: num_list.append(num_list[-1] - num_list[-2]) else: num_list.append(num_list[-1]*2) return num_list

programmers 2023. 7. 25. 13:18

def solution(num_list): answer = 0 odd, even = list(), list() for i in num_list: if i%2 == 0: even.append(str(i)) else: odd.append(str(i)) return int(''.join(odd)) + int(''.join(even))

programmers 2023. 7. 25. 13:18

def solution(num_list): answer = 0 x,y = 1,0 for num in num_list: x *= num y += num y = y**2 if x y: answer = 0 return answer

programmers 2023. 7. 25. 13:17

def solution(a, b, c): answer = 0 if a != b and a != c and b != c: answer = a+b+c elif a == b and a == c and b == c: answer = (a+b+c) * (a**2+b**2+c**2) * (a**3+b**3+c**3) else: answer = (a+b+c) * (a**2+b**2+c**2) return answer

programmers 2023. 7. 25. 13:17

def solution(a, d, included): answer = list() result = 0 for i in range(len(included)): answer.append(a+(i*d)) for x,y in zip(answer,included): if y == True: result += x return result

programmers 2023. 7. 25. 13:16

def solution(code): ret = list() mode = 0 for index, element in enumerate(code): if element == '1': if mode == 1: mode = 0 elif mode == 0: mode = 1 continue # 모드가 0이고 if mode == 0: # 인덱스가 짝수이면 if index%2 == 0: ret.append(element) # 모드가 1이고 if mode == 1: # 인덱스가 홀수이면 if index%2 != 0: ret.append(element) if len(ret) == 0: return "EMPTY" return ''.join(ret)

programmers 2023. 7. 25. 13:16