Q17-18

03 자료구조/03-4 슬라이딩 윈도우/Q010_jiwon.py

@@ -1,8 +1,3 @@
-# �����̵� �����츦 deque���� �����ϸ� ���� ȿ���� �� �� ����
-# deque�� ����
-# ���� : appendleft() ����, popleft() ����
-# ������ : append() ����, pop() ����
-
 import sys
 from collections import deque
 input = lambda : sys.stdin.readline().rstrip()

04 정렬/04-1 버블 정렬/Q016_jiwon.py

@@ -13,5 +13,5 @@
 for i in range(N):
     if Max < sorted_A[i][1] - i: # ���� �� index - ���� �� index ����� �ִ� ����
         Max = sorted_A[i][1] - i
-
+ 
 print(Max + 1)

04 정렬/04-2 선택 정렬/Q17_jiwon.py

@@ -0,0 +1,15 @@
+A = list(map(int, input()))
+
+# 최댓값을 찾아 앞으로 swap 시켜주기
+for i in range(len(A)):
+    max_value = i
+    for j in range(i+1, len(A)):
+        if A[max_value] < A[j]:
+            max_value = j
+    if A[max_value] > A[i]:
+        temp = A[i]
+        A[i] = A[max_value]
+        A[max_value] = temp
+
+for i in range(len(A)):
+    print(A[i], end='')

04 정렬/04-3 삽입 정렬/Q18_jiwon.py

@@ -0,0 +1,24 @@
+N = int(input())
+A= list(map(int, input()))
+S = [0]*N
+
+result = 0
+
+for i in range(1, N):
+    point = i
+    value = A[i]
+    for j in range(i-1, -1, -1):
+        if A[j] < A[i]:
+            point = j + 1
+            break
+        if j == 0:
+            point = 0
+    for j in range(i, point, -1):
+        A[j] = A[j-1]
+    A[point] = value
+
+S[0] = A[0]
+for i in range(1, N):
+    S[i] = S[i-1] + A[i]
+
+print(sum(S))