Github & Portfolio
๐ Problem Solving/Programmers(43)
-
[ํ๋ก๊ทธ๋๋จธ์ค-Lv2] ๊ฑฐ๋ฆฌ๋๊ธฐ ํ์ธํ๊ธฐ / Python
์ฝ๋ฉํ ์คํธ ์ฐ์ต - ๊ฑฐ๋ฆฌ๋๊ธฐ ํ์ธํ๊ธฐ [["POOOP", "OXXOX", "OPXPX", "OOXOX", "POXXP"], ["POOPX", "OXPXP", "PXXXO", "OXXXO", "OOOPP"], ["PXOPX", "OXOXP", "OXPOX", "OXXOP", "PXPOX"], ["OOOXX", "XOOOX", "OOOXX", "OXOOX", "OOOOO"], ["PXPXP", "XPXPX", "PXPXP", "XPXPX", "PXPXP"]] [1, 0, 1, 1, 1] programmers.co.kr from collections import deque dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] def bfs(i, j, length, element): q = deq..
-
[ํ๋ก๊ทธ๋๋จธ์ค-Lv1] ์ซ์ ๋ฌธ์์ด๊ณผ ์๋จ์ด / Python
์ฝ๋ฉํ ์คํธ ์ฐ์ต - ์ซ์ ๋ฌธ์์ด๊ณผ ์๋จ์ด ๋ค์ค์ ํ๋ก๋๊ฐ ์ซ์๋์ด๋ฅผ ํ๊ณ ์์ต๋๋ค. ๋ค์ค๊ฐ ํ๋ก๋์๊ฒ ์ซ์๋ฅผ ๊ฑด๋ฌ ๋ ์ผ๋ถ ์๋ฆฟ์๋ฅผ ์๋จ์ด๋ก ๋ฐ๊พผ ์นด๋๋ฅผ ๊ฑด๋ค์ฃผ๋ฉด ํ๋ก๋๋ ์๋ ์ซ์๋ฅผ ์ฐพ๋ ๊ฒ์์ ๋๋ค. ๋ค์์ ์ซ์์ ์ผ๋ถ ์ programmers.co.kr alpha = ["zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"] def solution(s): start = 0 end = 1 answer = "" while start < len(s): if s[start].isdigit(): answer += s[start] start = end end += 1 continue if s[start:end] in alpha..
-
[ํ๋ก๊ทธ๋๋จธ์ค-Lv3] ๋ฑ๊ตฃ๊ธธ / Python
์ฝ๋ฉํ ์คํธ ์ฐ์ต - ๋ฑ๊ตฃ๊ธธ ๊ณ์๋๋ ํญ์ฐ๋ก ์ผ๋ถ ์ง์ญ์ด ๋ฌผ์ ์ ๊ฒผ์ต๋๋ค. ๋ฌผ์ ์ ๊ธฐ์ง ์์ ์ง์ญ์ ํตํด ํ๊ต๋ฅผ ๊ฐ๋ ค๊ณ ํฉ๋๋ค. ์ง์์ ํ๊ต๊น์ง ๊ฐ๋ ๊ธธ์ m x n ํฌ๊ธฐ์ ๊ฒฉ์๋ชจ์์ผ๋ก ๋ํ๋ผ ์ ์์ต๋๋ค. ์๋ ๊ทธ๋ฆผ์ m = programmers.co.kr import sys input = sys.stdin.readline m, n = map(int, input().split()) puddles = [list(map(int, input().split())) for _ in range(int(input()))] def solution(m, n, puddles): d = [[0] * (m + 1) for _ in range(n + 1)] d[1][1] = 1 for i in range(1, n + 1): f..
-
[ํ๋ก๊ทธ๋๋จธ์ค-Lv3] ์ด์ค์ฐ์ ์์ํ / Python
์ฝ๋ฉํ ์คํธ ์ฐ์ต - ์ด์ค์ฐ์ ์์ํ programmers.co.kr import sys import heapq input = sys.stdin.readline operations = [input().rstrip() for _ in range(int(input()))] def solution(operations): q = [] for s in operations: oper, num = s.split()[0], int(s.split()[1]) if oper == "I": heapq.heappush(q, num) elif q and oper == "D": if num == 1: q.pop() else: heapq.heappop(q) if len(q) == 0: return [0, 0] return [max(q)..
-
[ํ๋ก๊ทธ๋๋จธ์ค-Lv3] ๊ฐ์ฅ ๋จผ ๋ ธ๋ / Python
์ฝ๋ฉํ ์คํธ ์ฐ์ต - ๊ฐ์ฅ ๋จผ ๋ ธ๋ 6 [[3, 6], [4, 3], [3, 2], [1, 3], [1, 2], [2, 4], [5, 2]] 3 programmers.co.kr import sys from collections import deque input = sys.stdin.readline n = int(input()) vertex = [list(map(int, input().split())) for _ in range(int(input()))] def getDistance(start, graph, distance): queue = deque() queue.append(start) while queue: x = queue.popleft() for i in graph[x]: if i == 1: con..
-
[ํ๋ก๊ทธ๋๋จธ์ค-Lv3] ๋คํธ์ํฌ / Python
์ฝ๋ฉํ ์คํธ ์ฐ์ต - ๋คํธ์ํฌ ๋คํธ์ํฌ๋ ์ปดํจํฐ ์ํธ ๊ฐ์ ์ ๋ณด๋ฅผ ๊ตํํ ์ ์๋๋ก ์ฐ๊ฒฐ๋ ํํ๋ฅผ ์๋ฏธํฉ๋๋ค. ์๋ฅผ ๋ค์ด, ์ปดํจํฐ A์ ์ปดํจํฐ B๊ฐ ์ง์ ์ ์ผ๋ก ์ฐ๊ฒฐ๋์ด์๊ณ , ์ปดํจํฐ B์ ์ปดํจํฐ C๊ฐ ์ง์ ์ ์ผ๋ก ์ฐ๊ฒฐ๋์ด ์ programmers.co.kr import sys from collections import deque input = sys.stdin.readline n = int(input()) compters = [list(map(int, input().split())) for _ in range(n)] def bfs(n, computers, v, visited): queue = deque() queue.append(v) visited[v] = True while queue: x = queue.p..