93차 3번 문제풀이

Author: Yujin-Baek

live9/test93/문제1/박희경.py

@@ -0,0 +1,25 @@
+"""
+1 (st = [1]) -> 9 (st = [9]) -> 2 -> 4 (st = [9, 4])
+"""
+def solution(number, k):
+    answer = 0
+    number = list(map(str, number.rstrip()))
+    
+    stack = []
+
+    for num in number:
+        if not stack:
+            stack.append(num)
+            continue
+        if k > 0:
+            while stack[-1] < num:  # 다음 수가 더 클 때
+                stack.pop()
+                k -= 1
+                if not stack or k <= 0:
+                    break
+        stack.append(num)
+
+    if k > 0:
+        stack = stack[:-k]
+
+    return ''.join(stack)

live9/test93/문제1/백한결.py

@@ -0,0 +1,12 @@
+def solution(number, k):
+    max_num = []
+
+    for i in number:
+        while max_num and k > 0 and max_num[-1] < i:
+            max_num.pop()
+            k -= 1
+        max_num.append(i)
+
+    answer = ''.join(max_num[:len(number) - k])
+
+    return answer

live9/test93/문제1/황장현.js

@@ -0,0 +1,30 @@
+function solution(number, k) {
+  let stack = [];
+  let 제거할수 = k;
+
+  for (let i = 0; i < number.length; i++) {
+    while (
+      제거할수 > 0 &&
+      stack.length > 0 &&
+      stack[stack.length - 1] < number[i]
+    ) {
+      stack.pop();
+      제거할수--;
+    }
+    stack.push(number[i]);
+  }
+
+  while (제거할수 > 0) {
+    stack.pop();
+    제거할수--;
+  }
+
+  return stack.join('');
+}
+
+// console.log(solution('1924', 2));
+// console.log(solution('1231234', 3));
+// console.log(solution('4177252841', 4));
+// console.log(solution('10', 1)); // 1
+// console.log(solution('9876543214', 4)); // 987654
+console.log(solution('333222111', 4)); // 33322

live9/test93/문제2/박희경.py

@@ -0,0 +1,22 @@
+def solution(name):
+    answer = 0
+    
+    # 기본 최소 좌우 이동 횟수는 길이 - 1
+    min_move = len(name) - 1
+    
+    for i, alpha in enumerate(name):
+        answer += min(ord(alpha) - ord('A'), ord('Z') - ord(alpha) + 1)
+
+        # 연속된 A의 끝나는 위치 찾기
+        next = i + 1
+        while next < len(name) and name[next] == 'A':
+            next += 1
+        
+        min_move = min([
+                        min_move,                     # 기존 오른쪽으로 끝까지 가는 경우
+                        2 * i + len(name) - next,     # 처음부터 i까지 갔다가 뒤로 "돌아가기(*2)"
+                        i + 2 * (len(name) - next)    # A 지나서 끝까지 갔다가 "돌아오기(*2)"
+                    ])
+        
+    answer += min_move
+    return answer

live9/test93/문제2/백한결.py

@@ -0,0 +1,22 @@
+def solution(name):
+    count = 0
+
+    for a in name:
+        count += min(ord(a) - ord('A'), ord('Z') - ord(a) + 1)
+
+    min_move = len(name) - 1
+
+    for i in range(len(name)):
+        next = i + 1
+        while next < len(name) and name[next] == 'A':
+            next += 1
+
+        move = min(i, len(name) - next) * 2 + max(i, len(name) - next)
+        min_move = min(min_move, move)
+
+    count += min_move
+
+    return count
+
+
+print(solution("JEROEN"))

live9/test93/문제2/황장현.js

@@ -0,0 +1,27 @@
+function solution(name) {
+  let moveCount = 0;
+  let minMove = name.length - 1;
+
+  for (let i = 0; i < name.length; i++) {
+    const char = name[i];
+    moveCount += Math.min(char.charCodeAt(0) - 65, 91 - char.charCodeAt(0));
+
+    let nextIdx = i + 1;
+    while (nextIdx < name.length && name[nextIdx] === 'A') {
+      nextIdx++;
+    }
+
+    minMove = Math.min(
+      minMove,
+      i * 2 + (name.length - nextIdx),
+      i + 2 * (name.length - nextIdx)
+    );
+  }
+
+  return moveCount + minMove;
+}
+
+// console.log(solution('JEROEN'));
+// console.log(solution('JAAAN'));
+// console.log(solution('JAAAKAN'));
+console.log(solution('AAABAAAAB'));

live9/test93/문제3/박희경.py

@@ -0,0 +1,10 @@
+def solution(routes):
+    answer = 0
+    camera = float('-inf')
+    
+    routes.sort(key=lambda x: x[1])
+    for i in range(len(routes)):
+        if routes[i][0] > camera:   # 진입 지점이 카메라보다 뒤에 있는 경우 카메라 추가해야 함 
+            answer += 1
+            camera = routes[i][1]   # 진출 지점에 카메라 설치
+    return answer

live9/test93/문제3/백한결.py

@@ -0,0 +1,12 @@
+def solution(routes):
+    routes.sort(key=lambda x: x[1])
+
+    count = 0
+    camera = -30001
+
+    for i in range(len(routes)):
+        if routes[i][0] > camera:
+            count += 1
+            camera = routes[i][1]
+
+    return count

live9/test93/문제3/황장현.js

@@ -0,0 +1,26 @@
+function solution(routes) {
+  routes.sort((a, b) => a[1] - b[1]);
+
+  let cameraCount = 0;
+  let lastCameraPos = -30001;
+
+  for (let route of routes) {
+    let [enter, exit] = route;
+
+    if (enter > lastCameraPos) {
+      cameraCount++;
+      lastCameraPos = exit;
+    }
+  }
+
+  return cameraCount;
+}
+
+console.log(
+  solution([
+    [-20, -15],
+    [-14, -5],
+    [-18, -13],
+    [-5, -3],
+  ])
+);