Merge pull request #13 from Kojungbeom/main

kojungbeom / 3월 5주차 / 17문제

Author: learntosurf

kojungbeom/Programmers/Level2/2xn 타일링.py

@@ -0,0 +1,23 @@
+# DP 안 쓴 버전
+def solution(n):
+    answer = 0
+    temp1 = 1
+    temp2 = 1
+    for i in range(n):
+        answer += temp2
+        temp1, temp2 = answer, temp1
+
+    return answer % 1000000007
+
+
+# DP 쓴 버전
+def solution(n):
+    answer = 0
+    dp = [0] * (n+1)
+    dp[0] = 1
+    dp[1] = 1
+
+    for i in range(2, n+1):
+        dp[i] = dp[i-1] + dp[i-2]
+
+    return dp[-1] % 1000000007

kojungbeom/Programmers/Level2/2개 이하로 다른 비트.py

@@ -0,0 +1,21 @@
+def solution(numbers):
+    answer = []
+    for n in numbers:
+        n_str = list(str(bin(n)).replace('0b', ''))
+        flag = False
+        for i in range(len(n_str)-1, -1, -1):
+            if n_str[i] == '0':
+                if i == len(n_str)-1:
+                    flag = True
+                    n_str[i] = '1'
+                    break
+                elif n_str[i] == '0' and n_str[i+1] == '1':
+                    n_str[i], n_str[i+1] = n_str[i+1], n_str[i]
+                    flag = True
+                    break
+        n_str = ''.join(n_str)
+        if not flag:
+            n_str = '10' + n_str[1:]
+        answer.append(int(n_str, 2))
+
+    return answer

kojungbeom/Programmers/Level2/다리를 지나는 트럭.py

@@ -0,0 +1,17 @@
+def solution(bridge_length, weight, truck_weights):
+    bridge = []
+    all_weight = 0
+    t = 0
+    while truck_weights or bridge:
+        t += 1
+
+        if bridge and t - bridge[0][1] == bridge_length:
+            truck, _ = bridge.pop(0)
+            all_weight -= truck
+
+        if truck_weights and all_weight + truck_weights[0] <= weight:
+            truck = truck_weights.pop(0)
+            bridge.append([truck, t])
+            all_weight += truck
+
+    return t

kojungbeom/Programmers/Level2/롤케이크 자르기.py

@@ -0,0 +1,26 @@
+def solution(topping):
+    answer = 0
+    cdict = {}
+    bdict = {}
+
+    for t in topping:
+        if t in bdict:
+            bdict[t] += 1
+        else:
+            bdict[t] = 1
+
+    for t in topping:
+        bdict[t] -= 1
+        if bdict[t] == 0:
+            del bdict[t]
+
+        if t in cdict:
+            cdict[t] += 1
+        else:
+            cdict[t] = 1
+
+        if len(bdict) == len(cdict):
+            answer += 1
+        elif len(bdict) < len(cdict):
+            break
+    return answer

kojungbeom/Programmers/Level2/소수 찾기.py

@@ -0,0 +1,99 @@
+def solution(numbers):
+    answer = 0
+    permute = set()
+    # DFS로 모든 숫자의 케이스를 set에 저장하자
+    stack = [([], [0]*len(numbers))] # current list,  visited
+    lenN = len(numbers)
+    while stack:
+        currentT, visited = stack.pop()
+        permute.add(tuple(currentT))
+        if len(currentT) == lenN:
+            continue
+
+        for i in range(lenN):
+            if not visited[i]:
+                new_cT = currentT[:]
+                new_visisted = visited[:]
+                new_cT.append(numbers[i])
+                new_visisted[i] = True
+                stack.append([new_cT, new_visisted])
+
+    temp = []
+    new_permute = []
+    for p in permute:
+        p_str = ''.join(p)
+        if p and not p[0] == '0':
+            new_permute.append(int(p_str))
+
+    def sosu(n):
+        if n < 2:
+            return False
+        elif n == 2:
+            return True
+        else:
+            for i in range(2, n//2+1):
+                if n % i == 0:
+                    return False
+            return True
+    for p in new_permute:
+        if sosu(p):
+            answer += 1
+
+    return answer
+
+
+#ChatGPT의 개선안
+from itertools import permutations
+
+def solution(numbers):
+    answer = 0
+    permute = set()
+    for i in range(1, len(numbers) + 1):
+        permute |= set(map(int, map(''.join, permutations(numbers, i))))
+
+    def is_prime(n):
+        if n < 2:
+            return False
+        for i in range(2, int(n ** 0.5) + 1):
+            if n % i == 0:
+                return False
+        return True
+
+    for p in permute:
+        if is_prime(p):
+            answer += 1
+
+    return answer
+
+
+def solution(numbers):
+    answer = 0
+    visited = [False] * len(numbers)
+    permute = set()
+
+    def dfs(current):
+        nonlocal permute
+        if current:
+            permute.add(int(''.join(current)))
+
+        for i in range(len(numbers)):
+            if not visited[i]:
+                visited[i] = True
+                dfs(current + [numbers[i]])
+                visited[i] = False
+
+    dfs([])
+
+    def is_prime(n):
+        if n < 2:
+            return False
+        for i in range(2, int(n ** 0.5) + 1):
+            if n % i == 0:
+                return False
+        return True
+
+    for p in permute:
+        if is_prime(p):
+            answer += 1
+
+    return answer

kojungbeom/Programmers/Level2/숫자 변환하기.py

@@ -0,0 +1,22 @@
+from collections import deque
+
+def solution(x, y, n):
+    visited = set()
+    queue = deque([(x, 0)])  # (현재 수, 연산 횟수)
+
+    while queue:
+        current, count = queue.popleft()
+
+        if current == y:
+            return count
+
+        if current > y:
+            continue
+
+        if current not in visited:
+            visited.add(current)
+            queue.append((current + n, count + 1))
+            queue.append((current * 2, count + 1))
+            queue.append((current * 3, count + 1))
+
+    return -1

kojungbeom/Programmers/Level2/연속된 부분 수열의 합.py

@@ -0,0 +1,19 @@
+def solution(sequence, k):
+    left, right = 0, 0
+    lenS = len(sequence)
+    answer = [0, lenS]
+    sum_permute = sequence[0]
+
+    while True:
+        if sum_permute < k:
+            right += 1
+            if right == lenS:
+                break
+            sum_permute += sequence[right]
+        else:
+            if sum_permute == k:
+                if right - left < answer[1]-answer[0]:
+                    answer = [left, right]
+            sum_permute -= sequence[left]
+            left += 1
+    return answer

kojungbeom/Programmers/Level2/오픈채팅방.py

@@ -0,0 +1,25 @@
+def solution(record):
+    answer = []
+    id2nick = {}
+    command = []
+    for r in record:
+        #print(r.split(' '))
+        rlist = r.split(' ')
+        
+        if rlist[0] == "Change" or rlist[0] == "Enter":
+            id2nick[rlist[1]] = rlist[2]
+        
+        command.append([rlist[0], rlist[1]])
+        
+    
+    
+    for c in command:
+        com, id = c
+        if com == "Enter":
+            sentence = f'{id2nick[id]}님이 들어왔습니다.'
+            answer.append(sentence)
+        elif com == "Leave":
+            sentence = f'{id2nick[id]}님이 나갔습니다.'
+            answer.append(sentence)
+    
+    return answer

kojungbeom/Programmers/Level2/택배상자.py

@@ -0,0 +1,25 @@
+def solution(record):
+    answer = []
+    id2nick = {}
+    command = []
+    for r in record:
+        #print(r.split(' '))
+        rlist = r.split(' ')
+        
+        if rlist[0] == "Change" or rlist[0] == "Enter":
+            id2nick[rlist[1]] = rlist[2]
+        
+        command.append([rlist[0], rlist[1]])
+        
+    
+    
+    for c in command:
+        com, id = c
+        if com == "Enter":
+            sentence = f'{id2nick[id]}님이 들어왔습니다.'
+            answer.append(sentence)
+        elif com == "Leave":
+            sentence = f'{id2nick[id]}님이 나갔습니다.'
+            answer.append(sentence)
+    
+    return answer

kojungbeom/Programmers/Level2/파일명 정렬.py

@@ -0,0 +1,28 @@
+def solution(files):
+    answer = []
+    temp = []
+    for idx, f in enumerate(files):
+        number_start = 0
+        number_end = len(f)
+        flag1 = True
+        flag2 = True
+        for i, c in enumerate(f):
+            cisdigit = c.isdigit()
+            if cisdigit:
+                if flag1:
+                    number_start = i
+                    flag1 = False
+            elif not cisdigit and not flag1:
+                if flag2:
+                    flag2 = False
+                    number_end = i
+        #print(f, number_start, number_end)
+        temp.append([idx, f[:number_start].lower(), int(f[number_start:number_end])]) 
+                    
+        
+    
+    temp.sort(key=lambda x:(x[1], x[2]))
+    for t in temp:
+        answer.append(files[t[0]])
+
+    return answer