𝑆𝑢𝑛𝑠ℎ𝑖𝑛𝑒 𝑎𝑓𝑡𝑒𝑟 𝑟𝑎𝑖𝑛✧

# 프로그래머스 최댓값과 최솟값 def solution(s): num_list = list(map(int, s.split())) min_num, max_num = min(num_list), max(num_list) return " ".join([str(min_num), str(max_num)]) # 프로그래머스 다음 큰 숫자 def solution(a): next = a+1 while True: if str(format(a,'b')).count("1") == str(format(next,'b')).count("1") : return next next +=1 ✅Point 이진수로 변환하는 방법 .format(숫자, 'b')

# 프로그래머스 거리두기 확인하기 from collections import deque d_row = [0, -1, 0, 1] d_col = [1, 0, -1, 0] def solution(places): answer = [] for i in range(5): result = bfs(places[i]) answer.append(result) return answer def bfs(place): queue = deque() visited = [[False] * 5 for _ in range(5)] for i in range(5): for j in range(5): if place[i][j] == 'P': queue.append([i, j, False]) if place[i][j] == 'O': queue...

#프로그래머스 게임 맵 최단거리 from collections import deque def solution(maps): n, m = 0, 0 for _ in range(len(maps)): n += 1 for _ in maps[0]: m += 1 d_row = [0, -1, 0, 1] d_col = [1, 0, -1, 0] queue = deque() queue.append([0,0]) maps[0][0] = 1 while queue: x, y = queue.popleft() if x == n-1 and y == m-1: return maps[n-1][m-1] for d in range(4): nx = x + d_row[d] ny = y + d_col[d] if 0

16956번 - 풀이 1( bfs로 풀이) #백준 16956 풀이 1 import sys from collections import deque input = sys.stdin.readline r, c = map(int, input().split()) graph = [list(map(str, input().rstrip())) for _ in range(r)] visited = [[False] * c for _ in range(r)] d_row = [0, -1, 0, 1] d_col = [1, 0, -1, 0] def bfs(): queue = deque() flag = False for i in range(r): for j in range(c): if graph[i][j] == 'W': queue.appe..

#16165 걸그룹 마스터 준석이 import sys input = sys.stdin.readline n, m = map(int, input().split()) groups = {} for _ in range(n): team_name = input() groups[team_name] = list() team_mem = int(input()) for _ in range(team_mem): mem = input() groups[team_name].append(mem) for _ in range(m): quiz = input() quiz_type = int(input()) if quiz_type == 0: for mem in sorted(groups[quiz]): print(mem) else: for grou..

# 백준 1916 import heapq import sys input = sys.stdin.readline n= int(input()) m = int(input()) graph = [[] for _ in range(n+1)] for _ in range(m): a, b, c = map(int, input().split()) graph[a].append([b, c]) start, end = map(int, input().split()) def dijkstra(start, end): queue = [] min_dist = [1e9] * (n + 1) heapq.heappush(queue, [0, start]) min_dist[start] = 0 while queue: current_dist, current_..

# 백준 1743 from collections import deque import sys n, m, k = map(int, sys.stdin.readline().split()) graph = [[0]* m for _ in range(n)] for _ in range(k): a, b = map(int,sys.stdin.readline().split()) graph[a-1][b-1] = 1 d_row = [0, -1, 0, 1] d_col = [1, 0, -1, 0] def bfs(result, i, j): queue = deque() queue.append([i, j]) cnt = 0 while queue: x, y = queue.popleft() for next in range(4): nx = x+ d..

@Enumerated 자바 enum 타입을@Enumerated 애노테이션을 통해 엔티티 매핑할수 있다. @Enumerated 어노테이션에는 EnumType.ORIGINAL : enum 순서(숫자) 값을 DB에 저장 EnumType.STRING: enum 이름 값을 DB에 저장 두가지 타입이 있다. 예로 들어, @AllArgsConstructor public enum UserRole { ROLE_ADMIN("관리자"), ROLE_USER("회원"); private final String description; } @Column(nullable = false) @Enumerated(EnumType.ORDINAL) private UserRole roles; 해당 enum을 ORIDINAL로 지정하고 role속..