6/28 문자열 압축

choieungi/12-9 문자열 압축.py

@@ -0,0 +1,19 @@
+def solution(s):
+    answer = len(s)
+    l = len(s)
+    for step in range(1, l // 2 + 1):
+        cnt = 1
+        compressed = ""
+        prev = s[0:step]
+        for i in range(step, l, step):
+            if s[i:i + step] == prev:
+                cnt += 1
+            else:
+                compressed += str(cnt) + prev if cnt > 1 else prev
+                prev = s[i: i + step]
+                cnt = 1
+        compressed += str(cnt) + prev if cnt > 1 else prev
+
+        answer = min(answer, len(compressed))
+
+    return answer

choieungi/TeamNote/rotate_array.py

@@ -0,0 +1,24 @@
+# rotate left n*m array
+
+def rotate(space, n, m):
+    new_space = [[0]*m for _ in range(n)]
+
+    for i in range(n):
+        for j in range(m):
+            new_space[n-j-1][i] = space[i][j]
+    return new_space
+
+
+test_space = [[1, 2, 3],
+              [4, 5, 6],
+              [7, 8, 9]]
+
+return_val = rotate(test_space,len(test_space), len(test_space[0]))
+
+for i in return_val:
+    print (i)
+"""
+[3, 6, 9]
+[2, 5, 8]
+[1, 4, 7]
+"""

choieungi/main.py

@@ -1,3 +1,19 @@
-s = [*map(int, input())]
-l = len(s)//2
-print("READY"if sum(s[:l])-sum(s[l:])else"LUCKY")
+def solution(s):
+    answer = len(s)
+    l = len(s)
+    for step in range(1, l // 2 + 1):
+        cnt = 1
+        compressed = ""
+        prev = s[0:step]
+        for i in range(step, l, step):
+            if s[i:i + step] == prev:
+                cnt += 1
+            else:
+                compressed += str(cnt) + prev if cnt > 1 else prev
+                prev = s[i: i + step]
+                cnt = 1
+        compressed += str(cnt) + prev if cnt > 1 else prev
+
+        answer = min(answer, len(compressed))
+
+    return answer