삽질 중에 최고의 삽질 개발자

def solution(s): alphabets = ['zero', 'one', 'two', 'three', 'four', 'five', 'six', 'seven', 'eight', 'nine'] result = s for idx in range(len(alphabets)): if alphabets[idx] in s: result = result.replace(alphabets[idx], f'{idx}') return int(result)

def solution(n, arr1, arr2): result = [] for idx in range(n): arr1_coordinate = bin(arr1[idx]).split("0b")[1].zfill(n) arr2_coordinate = bin(arr2[idx]).split("0b")[1].zfill(n) merge_coordinate = ""; for idx1 in range(n): if arr1_coordinate[idx1] == '1' or arr2_coordinate[idx1] == '1': merge_coordinate += '#' else: merge_coordinate += ' ' result.append(merge_coordinate) return result

def solution(n): trit = [] while n > 0: n_chk = int(n % 3) n = int(n / 3) trit.insert(0, n_chk) trit = trit[::-1] result = 0 trit_len = int(len(trit)) for idx in range(trit_len): result += (3 ** (trit_len-1)) * trit[idx] trit_len -= 1 return result

def solution(t, p): p_len = len(p) result = 0 for idx in range(len(t)): if len(t[idx:p_len+idx]) == p_len and int(t[idx:p_len+idx])

def solution(s, n): ord_A = ord('A') ord_Z = ord('Z') ord_a = ord('a') ord_z = ord('z') s_arr = [ ord(s[idx]) for idx in range(len(s)) ] result = [] for data in s_arr: if data == 32: result.append(" ") elif ord_A ord_z else chr(data + n) ) return ''.join(result)

def solution(number): count = 0 number_len = len(number) for idx1 in range(number_len): for idx2 in range(idx1+1, number_len): for idx3 in range(idx2+1, number_len): if number[idx1] + number[idx2] + number[idx3] == 0: count += 1 return count

도둑맞은 집중력을 읽는 데... 2주가 걸려버렸다... 곧 느낀점을 더 쓸 것이다. 이번에 고른 책은 "뭘 해도 되는 운명"을 읽어보려고 한다!!! 최대한 기간을 지키면서 읽도록 노력해보겠다!!!

def solution(sizes): all_sizes = [] for data in sizes: all_sizes.append(data[0]) all_sizes.append(data[1]) max_sizes = max(all_sizes) all_sizes = sorted(set(all_sizes), reverse=True) check_arr = [] for data in sizes: for size in all_sizes: if (data[0] > size or data[0] > max_sizes) and (data[1] > size or data[1] > max_sizes): check_arr.append(size) for data in set(check_arr): if data in all_size..

def solution(num1, num2): return num1 * num2

def solution(n, m): n_arr = [] result = [] n_count = n m_count = m # 최대 공약수 for idx in range(m): if n % int(idx+1) == 0 and m % int(idx+1) == 0: n_arr.append(idx+1) #최소 공배수 while n_count % m_count != 0: if n_count < m_count: n_count += n else: m_count += m return [max(n_arr), m_count if n_count - m_count < 0 else n_count ]