알고리즘
1. 최소직사각형
풀이:
https://school.programmers.co.kr/learn/courses/30/lessons/86491
def solution(sizes):
w = []
h = []
for i in range(len(sizes)):
if sizes[i][0] >= sizes[i][1]:
w.append(sizes[i][0])
h.append(sizes[i][1])
else:
h.append(sizes[i][0])
w.append(sizes[i][1])
return max(w) * max(h)
풀이:
def solution(s, n):
answer = ''
for i in s:
if i == " ":
answer += " "
else:
k = chr(ord(i)+n)
if k.isupper() != i.isupper() or not k.isalpha():
k = chr(ord(k) - 26)
answer += k
return answer
풀이:
def solution(s):
dic = {'zero':'0','one':'1', 'two':'2', 'three':'3', 'four':'4', 'five':'5', 'six':'6', 'seven':'7', 'eight':'8', 'nine':'9'}
for key in dic:
s = s.replace(key, dic[key])
return int(s)