Kcm hw (#84)

* 주말코테

* 변경사항

* kcmHW

* 찬민 프로그래머스 숙제

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,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)