commit

Author: bsyzch

cmkim/2021 네이버웹툰 개발 챌린지/1번문제.py

@@ -0,0 +1,25 @@
+def solution(lottery):
+    answer = -1
+
+    arr = [0] * 1001
+    visited = [0] * 1001
+    sum = 0
+    count = 0
+    for i in range(len(lottery)):
+        if lottery[i][1] == 0 and visited[lottery[i][0]] == 0:
+            arr[lottery[i][0]] += 1
+        else:
+            visited[lottery[i][0]] = 1
+
+    for i in range(1000):
+        if visited[i]:
+            sum += arr[i]
+            count += 1
+    #print(sum, count)
+
+    if sum:
+        answer = (sum+count) // count
+    else:
+        answer = 0
+
+    return answer

cmkim/2021 네이버웹툰 개발 챌린지/2번문제.py

@@ -0,0 +1,31 @@
+from _collections import deque
+
+
+
+dx = [-1, 1, 0, 0] #상하좌우
+dy = [0, 0, -1, 1]
+
+def solution(grid):
+    answer = 0
+    row = len(grid)
+    col = len(grid[0])
+    map = [[1e9] * col for _ in range(row)]
+    map[0][0] = grid[0][0]
+    q = deque()
+    q.append((0, 0))
+
+    while q:
+        x, y = q.popleft()
+        for i in range(4):
+            nx = x + dx[i]
+            ny = y + dy[i]
+            if 0 <= nx < row and 0 <= ny < col:
+                if map[x][y] + grid[nx][ny] < map[nx][ny]:
+                    map[nx][ny] = map[x][y] + grid[nx][ny]
+                    q.append((nx, ny))
+
+
+    answer = map[row-1][col-1]
+
+
+    return answer

cmkim/2021 네이버웹툰 개발 챌린지/3번문제.py

@@ -0,0 +1,18 @@
+from _collections import deque
+import copy
+
+def dfs(a, k):
+    q = deque()
+
+    for i in range(len(a)):
+        if a[i] =
+
+
+    return
+
+def solution(arr, k):
+    answer = -1
+    a = copy.deepcopy(arr)
+    dfs(a, k)
+
+    return answer

cmkim/Programmers/그래프/순위.py

@@ -1,4 +1,4 @@
 def solution(n, results):
     answer = 0
-     
+
     return answer

cmkim/Programmers/스택_큐/프린터.py

@@ -0,0 +1,35 @@
+from _collections import deque
+
+
+def solution(priorities, location):
+    answer = 0
+
+    q = deque()
+    result = deque()
+
+    for i in range(len(priorities)):
+        q.append((priorities[i], i))  # 우선 순위랑 인덱스 순서로 넣어준다
+
+    print(q)
+
+    while q:
+        pri, index = q.popleft()
+        flag = 0
+        #print('pri, index = ', pri, index)
+        for i in range(len(q)):
+            if q[i][0] > pri:
+                #print('if')
+                q.append((pri, index))
+                flag = 1
+                break
+        if flag == 0:
+            result.append((pri, index))
+    #print('i = ', i, q)
+
+    #print(result)
+
+    for i in range(len(result)):
+        if result[i][1] == location:
+            answer = i + 1
+
+    return answer

cmkim/Programmers/정렬/가장 큰 수.py

@@ -1,32 +1,20 @@
 def solution(numbers):
-
     answer = ''
-    count = 0
-    for i in range(len(numbers)):
-        count += len(str(numbers[i])) # i번째 숫자의 자리수를 더해줘서 총 자리수 구하기
-
-
-
-    return answer
 
-9
----------
+    num = list(map(str, numbers))
+    num.sort(key=lambda x: x*3, reverse=True)
 
-7.51
 
-7.53
 
-753
-755
+    for i in range(len(num)):
+        answer += num[i]
 
-7.92
+    zero_flag = 0
+    for i in range(len(answer)):
+        if answer[i] != '0':
+            zero_flag = 1
 
-75     / 10 = 7.55
+    if zero_flag == 0:
+        return '0'
 
-7   7.77
-
-7   7.77
-
-8
-
-9
+    return answer

cmkim/Programmers/해시/전화번호 목록.py

@@ -0,0 +1,17 @@
+def solution(phone_book):
+    answer = True
+    phone_book.sort()
+
+    # for a in range(len(phone_book)-1):
+    #     len_a = len(phone_book[a])
+    #     for b in range(a+1, len(phone_book)):
+    #         if phone_book[a] in phone_book[b][:len_a]:
+    #             answer = False
+
+    for a in range(len(phone_book) - 1):
+        len_a = len(phone_book[a])
+        if phone_book[a] in phone_book[a+1][:len_a]:
+            answer = False
+
+
+    return answer

cmkim/이것이 취업을 위한 코딩 테스트다/안테나_360p.py

@@ -5,7 +5,6 @@
 # print(a[(n - 1) // 2])
 
 
-
 n = int(input())
 arr = []
 arr = list(map(int, input().split()))

cmkim/이것이 취업을 위한 코딩 테스트다/특정 거리의 도시 찾기_339p.py

@@ -0,0 +1,53 @@
+"""
+@file dfsbfs-19.py
+@brief 연산자 끼워넣기
+@desc dfs
+"""
+
+INF = int(1e9)+1
+
+n = int(input())
+numbers = list(map(int, input().split()))
+ops = list(map(int, input().split()))  # +,-,*,/
+
+maxVal = -INF
+minVal = INF
+
+
+def dfs(cnt, hap, ops):
+    global maxVal
+    global minVal
+
+    if cnt == n:
+        maxVal = max(hap, maxVal)
+        minVal = min(hap, minVal)
+        return
+
+    if ops[0] > 0:
+        ops[0] -= 1
+        dfs(cnt+1, hap+numbers[cnt], ops)
+        ops[0] += 1
+
+    if ops[1] > 0:
+        ops[1] -= 1
+        dfs(cnt+1, hap-numbers[cnt], ops)
+        ops[1] += 1
+
+    if ops[2] > 0:
+        ops[2] -= 1
+        dfs(cnt+1, hap*numbers[cnt], ops)
+        ops[2] += 1
+
+    if ops[3] > 0:
+        ops[3] -= 1
+        if hap < 0:
+            dfs(cnt+1, -(-hap//numbers[cnt]), ops)
+        else:
+            dfs(cnt+1, hap//numbers[cnt], ops)
+        ops[3] += 1
+
+
+dfs(1, numbers[0], ops)
+
+print(maxVal)
+print(minVal)