Merge branch 'main' of https://github.com/JavaJobJava/CodingTest

Author: bsyzch

cmkim/Programmers/DFS_BFS/타겟 넘버.py

@@ -0,0 +1,27 @@
+from _collections import deque
+
+
+def solution(numbers, target):
+    answer = 0
+
+    q = deque()
+    q.append((0, 0))
+
+    while q:
+        value, index = q.popleft()
+
+        #print('value, index = ', value, index)
+
+        if index == len(numbers):
+            if value == target:
+                answer += 1
+
+        else:
+            temp = numbers[index]
+            q.append((value + temp, index + 1))
+            q.append((value - temp, index + 1))
+
+    return answer
+
+
+#print(solution([1, 1, 1, 1, 1], 3))

cmkim/Programmers/DP/N으로 표현.py

@@ -0,0 +1,36 @@
+from collections import deque
+
+
+def solution(n, edge):
+    answer = 0
+    visited = [-1] * (n + 1)
+    arr = [[] for _ in range(n + 1)]
+
+    for x, y in edge:
+        arr[x].append(y)
+        arr[y].append(x)
+
+    bfs(1, visited, arr)
+
+    max_v = max(visited)
+
+    for value in visited:
+        if value == max_v:
+            answer += 1
+
+    return answer
+
+
+def bfs(v, visited, arr):
+    count = 0
+    q = deque([[v, count]]) # 왜 이���게 해야 되는지? deque 넣을 때 () 와 [] 차이?
+
+    while q:
+        value = q.popleft()
+        v = value[0]
+        count = value[1]
+        if visited[v] == -1:
+            visited[v] = count
+            count += 1
+            for e in arr[v]:
+                q.append([e, count])

cmkim/Programmers/그래프/가장 먼 노드.py

@@ -0,0 +1,25 @@
+def solution(progresses, speeds):
+    answer = []
+    stack = []
+    count = len(progresses)
+    for i in range(count):
+        div = (100-progresses[i])//speeds[i]
+        if progresses[i] + div == 100:
+            stack.append(div)
+        else:
+            stack.append(div+1)
+
+    idx = stack[0]
+    count = 1
+    for i in range(1, len(stack)):
+        if stack[i] > idx:
+            answer.append(count)
+            count = 1
+            idx = stack[i]
+        else:
+            count +=1
+
+    answer.append(count)
+
+
+    return answer

cmkim/Programmers/스택_큐/기능개발.py

@@ -0,0 +1,27 @@
+def solution(answers):
+    answer = []
+    a = [1, 2, 3, 4, 5]
+    b = [2, 1, 2, 3, 2, 4, 2, 5]
+    c = [3, 3, 1, 1, 2, 2, 4, 4, 5, 5]
+    count = [0, 0, 0]
+    for i in range(len(answers)):
+        if answers[i] == a[i % 5]:
+            count[0] += 1
+
+    for i in range(len(answers)):
+        if answers[i] == b[i % 8]:
+            count[1] += 1
+
+    for i in range(len(answers)):
+        if answers[i] == c[i % 10]:
+            count[2] += 1
+
+    max_v = 0
+    for i in range(3):
+        max_v = max(max_v, count[i])
+
+    for i in range(3):
+        if count[i] == max_v:
+            answer.append(i + 1)
+
+    return answer

cmkim/Programmers/완전탐색/모의고사.py

@@ -0,0 +1,8 @@
+def solution(participant, completion):
+    participant.sort()
+    completion.sort()
+    num = len(completion)
+
+    for idx in range(num) :
+        if participant[idx] != completion[idx] : return participant[idx]
+    return participant[num]

cmkim/Programmers/해시/완주하지 못한 선수.py

@@ -0,0 +1,19 @@
+import heapq
+
+def solution(scoville, K):
+    answer = 0
+    heap = []
+    for i in range(len(scoville)):
+        heapq.heappush(heap, scoville[i])
+
+    while heap[0] < K:
+        if len(heap) < 2:
+            return -1
+
+        first = heapq.heappop(heap)
+        second = heapq.heappop(heap)
+        result = first + second * 2
+        heapq.heappush(heap, result)
+        answer += 1
+
+    return answer

cmkim/Programmers/힙/더 맵게.py

@@ -0,0 +1,86 @@
+n = int(input())
+
+arr = []
+temp = [[0] * n for _ in range(n)]
+teacher = []
+find = 0
+for i in range(n):
+    arr.append(list(map(str, input().split())))
+    for j in range(n):
+        if arr[i][j] == 'T':
+            teacher.append((i, j))
+
+
+def dfs(count):
+    global find
+    if count == 3:  # 장애물 3개가 다 설치된 경우
+        for i in range(n):  # 장애물 설치된 맵을 복사한 후에
+            for j in range(n):
+                temp[i][j] = arr[i][j]
+
+        if not check():  # 감시를 피하면 YES 출력후 종료
+            print("YES")
+            quit()
+
+        else:  # 감시 못피하면 다른 경우도 검사해보기
+            return
+
+    for i in range(n):  # 빈 공간에 대해서 장애물 3개까지 설치해보는 과정
+        for j in range(n):
+            if arr[i][j] == 'X':
+                arr[i][j] = 'O'  # 알파벳 O임
+                count += 1
+                dfs(count)
+                count -= 1
+                arr[i][j] = 'X'
+
+
+def check():
+    result = 0
+    for x, y in teacher:
+        for i in range(4):  # 상하좌우 방향 검사
+            if see(x, y, i):  # 학생의 위치를 파��한 경우
+                return True
+
+    return False  # 학생의 위치를 파악하지 못한 경우
+
+
+def see(x, y, dir):  # 상하좌우 순으로 검사
+    if dir == 0:
+        while 0 <= x < n:
+            if temp[x][y] == 'S':
+                return True
+            if temp[x][y] == 'O':
+                return False
+            else:
+                x -= 1
+    if dir == 1:
+        while 0 <= x < n:
+            if temp[x][y] == 'S':
+                return True
+            if temp[x][y] == 'O':
+                return False
+            else:
+                x += 1
+    if dir == 2:
+        while 0 <= y < n:
+            if temp[x][y] == 'S':
+                return True
+            if temp[x][y] == 'O':
+                return False
+            else:
+                y -= 1
+    if dir == 3:
+        while 0 <= y < n:
+            if temp[x][y] == 'S':
+                return True
+            if temp[x][y] == 'O':
+                return False
+            else:
+                y += 1
+
+    return False
+
+
+dfs(0)#dfs 함수안에서 한번만이라도 감시를 피했으면 YES 출력후 종료함
+print("NO")

cmkim/이것이 취업을 위한 코딩 테스트다/감시 피하기_352p.py

@@ -0,0 +1,61 @@
+n, m = map(int, input().split())
+
+arr = []
+temp = [[0] * m for _ in range(n)]
+result = 0
+
+dx = [-1, 1, 0, 0]
+dy = [0, 0, -1, 1]
+
+for i in range(n):
+    arr.append(list(map(int, input().split())))
+
+
+
+def dfs(count):
+    global result
+
+    if count == 3:
+        for i in range(n):
+            for j in range(m):
+                temp[i][j] = arr[i][j]
+
+        for i in range(n):
+            for j in range(m):
+                if temp[i][j] == 2:
+                    virus(i, j)
+
+        result = max(result, get_score())
+        return
+
+    for i in range(n):
+        for j in range(m):
+            if arr[i][j] == 0:
+                arr[i][j] = 1
+                count += 1
+                dfs(count)
+                arr[i][j] = 0
+                count -= 1
+
+
+def virus(x, y):
+    for i in range(4):
+        nx = x + dx[i]
+        ny = y + dy[i]
+        if 0 <= nx < n and 0 <= ny < m:
+            if temp[nx][ny] == 0:
+                temp[nx][ny] = 2
+                virus(nx, ny)
+
+
+def get_score():
+    score = 0
+    for i in range(n):
+        for j in range(m):
+            if temp[i][j] == 0:
+                score += 1
+    return score
+
+
+dfs(0)
+print(result)

cmkim/이것이 취업을 위한 코딩 테스트다/연구소_341p.py

@@ -0,0 +1,36 @@
+n = int(input())
+arr = list(map(int, input().split()))
+add, sub, mul, div = map(int, input().split())  # [+] [-] [*] [//]
+
+min_value = 1e9
+max_value = -1e9
+
+def dfs(count, value):
+    global min_value, max_value, add, sub, mul, div
+
+    if count == n:
+        min_value = min(min_value, value)
+        max_value = max(max_value, value)
+
+    else:
+        if add > 0:
+            add -= 1
+            dfs(count + 1, value + arr[count])
+            add += 1
+        if sub > 0:
+            sub -= 1
+            dfs(count + 1, value - arr[count])
+            sub += 1
+        if mul > 0:
+            mul -= 1
+            dfs(count + 1, value * arr[count])
+            mul += 1
+        if div > 0:
+            div -= 1
+            dfs(count + 1, int(value / arr[count]))
+            div += 1
+
+dfs(1, arr[0])
+
+print(max_value)
+print(min_value)