기록되지 않은 것은 기억되지 않는다.

프로그래머스 검색 결과

해당 글 4건

[Programmers | Level 3] 이중우선순위큐 (Python)

https://programmers.co.kr/learn/courses/30/lessons/42628 코딩테스트 연습 - 이중우선순위큐 programmers.co.kr import heapq def solution(operations): max_heap = [] min_heap = [] for i in operations: a, b = i.split(" ") b = int(b) if a == 'I': heapq.heappush(max_heap, -b) heapq.heappush(min_heap, b) if a == 'D' and b == 1: if not max_heap or not min_heap: continue min_heap.remove(-heapq.heappop(max_heap)) elif a ..

Algorithm | SQL/Programmers 2021. 5. 19. 19:08

[Programmers | Level 2] 행렬의 곱셈 (Python)

def solution(arr1, arr2): ans = [[0] * len(arr2[0]) for _ in range(len(arr1))] for i in range(len(arr1)): for j in range(len(arr2[0])): temp = 0 for k in range(len(arr1[0])): temp += arr1[i][k] * arr2[k][j] ans[i][j] = temp return ans 주어진 이차원 행렬 두개를 곱하는 문제. 인덱스를 다루는게 굉장히 까다로웠다. 파이써닉하게 풀지 못한 풀이ㅠㅠ zip과 unpacking을 활용한 풀이도 있는 것 같은데 아직 익숙치 않다.

Algorithm | SQL/Programmers 2021. 4. 30. 20:31

[Programmers | Level 2] 프린터 (Python)

from collections import deque def solution(priorities, location): printer = deque() result = [] for i in range(len(priorities)): printer.append([priorities[i], i]) while printer: MAX = 0 for i in printer: MAX = max(i[0], MAX) prior, document = printer.popleft() if prior < MAX: printer.append([prior, document]) else: result.append([prior, document]) for i in range(len(result)): if location == res..

Algorithm | SQL/Programmers 2021. 4. 30. 20:28

[Programmers | Level 2] 다리를 지나는 트럭 (Python)

from collections import deque def solution(bridge_length, weight, truck_weights): truck_weights = deque(truck_weights) bridge = deque([0 for _ in range(bridge_length)]) t = 0 bridge_weight = 0 while len(bridge) != 0: pass_truck = bridge.popleft() bridge_weight -= pass_truck t += 1 if truck_weights: if bridge_weight + truck_weights

Algorithm | SQL/Programmers 2021. 4. 30. 20:25