Lv3 파이썬 진행중

Author: wh2per

Programmers/Lv3/Lv3_2xn타일링.py

@@ -0,0 +1,9 @@
+def solution(n):
+    d = [0] * (n+1)
+    d[1] = 1
+    d[2] = 2
+    for i in range(3, n+1):
+        d[i] = (d[i-1] + d[i-2]) % 1000000007
+    return d[n]
+
+print(solution(4))

Programmers/Lv3/Lv3_N으로표현.py

@@ -0,0 +1,23 @@
+ans = -1
+
+def go(N, number, result, count):
+    global ans
+    if count > 8:       # 종료조건
+        return
+    if number == result:    # 완료조건
+        if count < ans or ans == -1:
+            ans = count
+        return
+    nn = 0
+    for i in range(0,8):
+        nn = nn * 10 + N
+        go(N, number, result + nn, count + 1 + i)
+        go(N, number, result - nn, count + 1 + i)
+        go(N, number, result * nn, count + 1 + i)
+        go(N, number, result // nn, count + 1 + i)
+
+
+def solution(N, number):
+    go(N,number,0,0)
+    return ans
+print(solution(5,12))

Programmers/Lv3/Lv3_가장긴팰린드롬.py

@@ -0,0 +1,18 @@
+def solution(s):
+    s = s.lower()
+    answer = []
+    if len(s)==1:
+        return 1
+    else:
+        for i in range(len(s)):
+            for j in range(0, i):
+                temp = s[j:i + 1]
+
+                if temp == temp[::-1]:      # 뒤집었을 때와 같은지
+                    answer.append(temp)
+        if answer:
+            return len(max(answer, key=len))
+        else:
+            return 1
+
+print(solution("asdf"))

Programmers/Lv3/Lv3_거스름돈.py

@@ -0,0 +1,10 @@
+def solution(n, money):
+    d = [0]*(n+1)
+    d[0] = 1
+
+    for i in money:
+        for j in range(i,n+1):
+            d[j] = (d[j] + d[j-i])%1000000007
+    return d[n]
+
+print(solution(5,[1,2,5]))

Programmers/Lv3/Lv3_기지국설치.py

@@ -0,0 +1,18 @@
+def solution(n, stations, w):
+    answer = 0
+    index = 1
+
+    size = 2*w+1
+    for i in stations:
+        answer += (i-w-index)//size
+        if (i-w-index)%size != 0:
+            answer += 1
+        index = i + w + 1
+    if n >= index:
+        answer += (n + 1 - index) // size
+        if (n + 1 - index) % size != 0:
+            answer += 1
+
+    return answer
+
+print(solution(	16, [9], 2))

Programmers/Lv3/Lv3_네트워크.py

@@ -0,0 +1,30 @@
+net = [[0]*201 for i in range(201)]
+check = [False]*201
+
+def dfs(x, n):
+    global net
+    global check
+
+    check[x] = 1
+
+    for i in range(n):
+        if net[x][i] == 1 and check[i] != 1:
+            dfs(i, n)
+
+def solution(n, computers):
+    answer = 0
+    global check
+
+    for i in range(n):
+        for j in range(n):
+            if computers[i][j] == 1:
+                net[i][j] = 1
+
+    for i in range(n):
+        if check[i] != 1:
+            dfs(i, n)
+            answer += 1
+
+    return answer
+
+print(solution(3, [[1, 1, 0], [1, 1, 0], [0, 0, 1]]))

Programmers/Lv3/Lv3_단속카메라.py

@@ -0,0 +1,25 @@
+def solution(routes):
+    answer = 0
+    cam = []
+    routes.sort(key=lambda e: e[0])     # 출발지점 기준으로 정렬
+
+    for i in routes:
+        cs = i[0]       # 출발지점 저장
+        flag =True
+        for j in cam:
+            if j[0] <= cs <= j[1]:
+                flag = True
+            else:               # 출발 지점이 카메라 영역안에 없다면
+                flag = False
+                break
+        if flag:
+            cam.append(i)
+        else:
+            answer += 1
+            cam.clear()
+            cam.append(i)
+
+    answer += 1
+    return answer
+
+print(solution([[-20,15], [-14,-5], [-18,-13], [-5,-3]]))

Programmers/Lv3/Lv3_멀리뛰기.py

@@ -0,0 +1,7 @@
+def solution(n):
+    d = [0]*(n+1)
+    d[0] = 1
+    d[1] = 1
+    for i in range(2,n+1):
+        d[i] = (d[i-1] + d[i-2])%1234567
+    return d[n]

Programmers/Lv3/Lv3_방문길이.py

@@ -0,0 +1,55 @@
+dy = [0,1,0,-1]
+dx = [1,0,-1,0]
+
+def solution(dirs):
+    global dy
+    global dx
+    answer = 0
+    visited = []
+
+    start = [0,0]
+    for i in dirs:
+        if i == 'U':
+            if [start,3] not in visited:
+                visited.append([start,3])
+            start = [start[0]+dy[1], start[1]+dx[1]]
+            if -5 > start[0] or start[0] > 5 or start[1] >5 or start[1] < -5:
+                start = [start[0] - dy[1], start[1] - dx[1]]
+                continue
+            if [start,1] not in visited:
+                visited.append([start,1])
+                answer += 1
+        elif i == 'R':
+            if [start,2] not in visited:
+                visited.append([start,2])
+            start = [start[0] + dy[0], start[1] + dx[0]]
+            if -5 > start[0] or start[0] > 5 or start[1] >5 or start[1] < -5:
+                start = [start[0] - dy[0], start[1] - dx[0]]
+                continue
+            if [start, 0] not in visited:
+                visited.append([start, 0])
+                answer += 1
+        elif i == 'D':
+            if [start,1] not in visited:
+                visited.append([start,1])
+            start = [start[0] + dy[3], start[1] + dx[3]]
+            if -5 > start[0] or start[0] > 5 or start[1] >5 or start[1] < -5:
+                start = [start[0] - dy[3], start[1] - dx[3]]
+                continue
+            if [start, 3] not in visited:
+                visited.append([start, 3])
+                answer += 1
+        elif i == 'L':
+            if [start,0] not in visited:
+                visited.append([start,0])
+            start = [start[0] + dy[2], start[1] + dx[2]]
+            if -5 > start[0] or start[0] > 5 or start[1] >5 or start[1] < -5:
+                start = [start[0] - dy[2], start[1] - dx[2]]
+                continue
+            if [start, 2] not in visited:
+                visited.append([start, 2])
+                answer += 1
+
+    return answer
+
+print(solution("LURDLLURD"))

Programmers/Lv3/Lv3_배달.py

@@ -0,0 +1,38 @@
+def search(cost, check):
+    end = 0
+    temp = 500001
+    for i in range(1, len(cost)):
+        if check[i] == False and cost[i] < temp:        # 가장 작은 비용이 드는 마을 번호
+            temp = cost[i]
+            end = i
+    return end
+
+def solution(N, road, K):
+    answer = 0
+
+    graph = [[500001 for col in range(N+1)] for row in range(N+1)]  # 비용 정보
+    cost = [500001] * (N + 1)
+    check = [False] * (N + 1)
+    cost[1] = 0  # 1번 지역은 0으로 초기화
+
+    for i in range(len(road)):
+        if graph[road[i][0]][road[i][1]] == 500001:
+            graph[road[i][0]][road[i][1]] = road[i][2]
+            graph[road[i][1]][road[i][0]] = road[i][2]
+        else:
+            if graph[road[i][0]][road[i][1]] > road[i][2]:
+                graph[road[i][0]][road[i][1]] = road[i][2]
+                graph[road[i][1]][road[i][0]] = road[i][2]
+
+    for i in range(1,N+1):
+        end = search(cost,check)        # 가장 가까운 마을 찾기
+        for j in range(1, N+1):
+            cost[j] = min(cost[j], cost[end] + graph[end][j])
+        check[end] = True
+
+    for i in range(1,len(cost)):
+        if cost[i] <= K:
+            answer += 1
+    return answer
+
+print(solution(5,[[1,2,1],[2,3,3],[5,2,2],[1,4,2],[5,3,1],[5,4,2]],3))