문제 : https://school.programmers.co.kr/learn/courses/30/lessons/250137?language=python3 나의 풀이def attack(health, damage, max_health): health -= damage if health   + 함수 하나로 표현한 더 간단한 풀이def solution(bandage, health, attacks): max_health = health count = 0 attack_count = 0 time = 1 while time

문제: https://school.programmers.co.kr/learn/courses/15008/lessons/121685 풀이def solution(queries): def find(n, p): if n == 1: return "Rr" parent = find(n-1, (p-1)//4+1) idx = (p-1) % 4 if parent == "RR": return "RR" elif parent == "rr": return "rr" else: return ["RR", "Rr", "Rr", "rr"][idx] return [find(n, ..

출처: https://school.programmers.co.kr/learn/courses/30/lessons/77485 코드def solution(rows, columns, queries): matrix = [] tmp = [] for i in range(1, (rows * columns + 1)): tmp.append(i) if (len(tmp) == columns): matrix.append(tmp) tmp = [] rotation(matrix, queries) return answer answer = []def rotation(matrix, queries): global answer ..

문제 출처: https://school.programmers.co.kr/learn/courses/30/lessons/67257  코드 from itertools import permutationsdef operation(num1, num2, op): if op == '+': return str(int(num1) + int(num2)) if op == '-': return str(int(num1) - int(num2)) if op == '*': return str(int(num1) * int(num2)) def calculate(expression, op): array = [] tmp = "" for i in expression: ..

https://school.programmers.co.kr/learn/courses/30/lessons/49189# 코드from collections import dequedef solution(n, edge): graph = [[] for _ in range(n+1)] visited = [0] * (n+1) for e in edge: x, y = e[0], e[1] graph[x].append(y) graph[y].append(x) q = deque() q.append(1) visited[1] = 1 while q: p = q.popleft() for i in graph[p]: ..

코딩테스트 연습 - 무인도 여행 | 프로그래머스 스쿨 (programmers.co.kr)  코드from collections import dequedef solution(maps): N, M = len(maps), len(maps[0]) visited = [[0] * M for _ in range(N)] queue = deque() answer = [] for i in range(N): for j in range(M): if maps[i][j] =='X' or visited[i][j]: continue queue.append((i,j)) visited[i][..

https://school.programmers.co.kr/learn/courses/30/lessons/42861  코드def solution(n, costs): answer = 0 costs.sort(key = lambda x: x[2]) s = set([costs[0][0]]) while len(s) != n: for v in costs: if v[0] in s and v[1] in s: continue if v[0] in s or v[1] in s: s.update([v[0], v[1]]) answer += v[2] ..

https://school.programmers.co.kr/learn/courses/30/lessons/64062  코드def solution(stones, k): s = 1 e = max(stones) mid = (s + e) // 2 while s = k: e = mid -1 break else: cnt = 0 else: s = mid + 1 return s - 순차탐색으로는 효율성을 만족하기 어려우므로 이진탐색으로 답을 구해야 한다.- s는 1, e는 디딤돌의 최댓값, mid는 (s + e) //2로 설정하고, 디딤돌을 ..