🔀merge: [230816] PGS 실패율, 후보키 - 2문제 (#98)

* ✨feat: 8월16일 프로그래머스 문제 풀이

* ✨feat: 8월25일 PGS 문제 풀이

오늘은 힐링 느낌으로 풀이했습니다!

JeonHyoChang/Season2/23.08.16 카카오 2문제/실패율.py

@@ -0,0 +1,23 @@
+def solution(N, stages):
+ dic = {}
+ for i in range(1, N + 1):
+ dic[i] = stages.count(i)
+
+ users = len(stages)
+ answerTemp = []
+ for i in range(1, N + 1):
+ if users != 0:
+ answerTemp.append((dic[i] / users, i))
+ else:
+ answerTemp.append((0, i))
+ users -= dic[i]
+ print(answerTemp)
+
+ answerTemp02 = sorted(answerTemp, key=lambda x: (-x[0], x[1]))
+ answer = [x[1] for x in answerTemp02]
+ return answer
+
+
+print(solution(5, [2, 1, 2, 6, 2, 4, 3, 3]))
+print(solution(4, [4, 4, 4, 4, 4]))
+print(solution(2, [1, 1, 1, 1]))

JeonHyoChang/Season2/23.08.16 카카오 2문제/후보키.py

@@ -0,0 +1,34 @@
+from itertools import combinations
+
+
+def solution(relation):
+ row = len(relation)
+ col = len(relation[0])
+ relationCombinations = []
+
+ for i in range(1, col + 1):
+ relationCombinations.extend(combinations(range(col), i))
+
+ # 유일성 체크
+ uniqueKeys = []
+ for x in relationCombinations:
+ tempSet = set()
+ for i in range(row):
+ tempSet.add(tuple(relation[i][j] for j in x))
+ if len(tempSet) == row:
+ uniqueKeys.append(x)
+ print(uniqueKeys)
+
+ # 최소성 체크
+ answer = set(uniqueKeys)
+ print(answer)
+ for i in range(len(uniqueKeys)):
+ for j in range(i + 1, len(uniqueKeys)):
+ if set(uniqueKeys[i]) & set(uniqueKeys[j]) == set(uniqueKeys[i]):
+ answer.discard(uniqueKeys[j])
+
+ return len(answer)
+
+
+print(solution([["100", "ryan", "music", "2"], ["200", "apeach", "math", "2"], ["300", "tube", "computer", "3"],
+ ["400", "con", "computer", "4"], ["500", "muzi", "music", "3"], ["600", "apeach", "music", "2"]]))

JeonHyoChang/Season2/23.08.25 카카오 2문제/두 개 뽑아서 더하기.py

@@ -0,0 +1,13 @@
+def solution(numbers):
+ answer = set()
+
+ for i in range(len(numbers)):
+ for j in range(i + 1, len(numbers)):
+ answer.add(numbers[i] + numbers[j])
+ answer = list(answer)
+ answer.sort()
+ return answer
+
+
+print(solution([2, 1, 3, 4, 1]))
+print(solution(([5, 0, 2, 7])))

JeonHyoChang/Season2/23.08.25 카카오 2문제/문자열 압축.py

@@ -0,0 +1,34 @@
+def combine(c, s):
+ if c != 1:
+ return str(c) + s
+ return s
+
+
+def solution(s):
+ answer = s
+
+ for i in range(1, len(s) // 2 + 1):
+ tempStr = ""
+ startStr = s[0:i]
+ count = 1
+ for j in range(i, len(s), i):
+ if s[j:j + i] == startStr:
+ count += 1
+ else:
+ tempStr += combine(count, startStr)
+ startStr = s[j:j + i]
+ count = 1
+ tempStr += combine(count, startStr)
+ print(tempStr)
+ if len(answer) > len(tempStr) or i == 1:
+ answer = tempStr
+
+ return len(answer)
+
+
+# print(solution("aabbaccc"))
+# print(solution("ababcdcdababcdcd"))
+# print(solution("abcabcdede"))
+# print(solution("abcabcabcabcdededededede"))
+# print(solution("xababcdcdababcdcd"))
+# print(solution("a"))