Add files via upload

Author: Albert-learner

LEVEL2/Day2/BestAndWorstRankOfLotto.py

@@ -0,0 +1,50 @@
+# 30. 로또의 최고 순위와 최저 순위
+
+'''스스로 풀었지만 비효율적인 풀이'''
+def solution(lottos, win_nums):
+    answer = [7, 7]
+
+    lottos.sort()
+    win_nums.sort()
+
+    for i in lottos:
+        if i == 0:
+            answer[0] -= 1
+        else:
+            for j in win_nums:
+                if i == j:
+                    answer[0] -= 1
+                    answer[1] -= 1
+
+    if answer[0] == 7:
+        answer[0] -= 1
+    if answer[1] == 7:
+        answer[1] -= 1
+
+    return answer
+
+lottos_1 = [44, 1, 0, 0, 31, 25]
+lottos_2 = [0, 0, 0, 0, 0, 0]
+lottos_3 = [45, 4, 35, 20, 3, 9]
+
+win_nums_1 = [31, 10, 45, 1, 6, 19]
+win_nums_2 = [38, 19, 20, 40, 15, 25]
+win_nums_3 = [20, 9, 3, 45, 4, 35]
+
+# print(solution(lottos_1, win_nums_1))
+# print(solution(lottos_2, win_nums_2))
+# print(solution(lottos_3, win_nums_3))
+
+def solution_best(lottos, win_nums):
+    answer = [6, 6, 5, 4, 3, 2, 1]
+
+    cnt_0 = lottos.count(0)
+    match = 0
+    for x in win_nums:
+        if x in lottos:
+            match += 1
+    return [answer[cnt_0 + match], answer[match]]
+
+print(solution_best(lottos_1, win_nums_1))
+print(solution_best(lottos_2, win_nums_2))
+print(solution_best(lottos_3, win_nums_3))

LEVEL2/Day2/FailRate.py

@@ -0,0 +1,93 @@
+# 38. 실패율
+
+# 내 풀이
+def solution(N, stages):
+    answer = []
+
+    # 실패율 딕셔너리
+    result = {}
+
+    # 도달한 플레이어 수 ... 매 단계마다 바뀔 수 있다
+    denominator = len(stages)
+
+    for stage in range(1, N + 1):
+        if denominator != 0:
+            fail_cnt = stages.count(stage)
+            result[stage] = fail_cnt / denominator
+            denominator -= fail_cnt
+        else:
+            result[stage] = 0
+
+    answer = sorted(result, key=lambda x: result[x],
+                    reverse = True)
+    return answer
+
+N_1 = 5
+N_2 = 4
+
+stages_1 = [2, 1, 2, 6, 2, 4, 3, 3]
+stages_2 = [4, 4, 4, 4, 4]
+
+print(solution(N_1, stages_1))
+print(solution(N_2, stages_2))
+
+# 이중 리스트 풀이 ... [2, 1, 2, 6, 2, 4, 3, 3] -> [[1], [2, 2, 2], [3, 3], [4], [6]]
+from collections import Counter
+def solution_mine(N, stages):
+    answer = []
+
+    # {'1' : 2, '2' : 3, ... }
+    result = {str(i): 0 for i in range(N + 1)}
+    for i in stages:
+        if str(i) in result.keys():
+            result[str(i)] += 1
+        else:
+            if i == N + 1:
+                result[str(0)] += 1
+
+    # 마지막까지 성공한 사람
+    success = {'0': result['0']}
+    del (result['0'])
+
+    denominator = len(stages)
+    failing_rate_lst = []
+    for stage, cnt in result.items():
+        failing_rate = 0
+        if cnt != 0:
+            failing_rate = cnt / denominator
+            failing_rate_lst.append(failing_rate)
+            denominator -= cnt
+        else:
+            failing_rate = 0
+            failing_rate_lst.append(failing_rate)
+
+    sort_failing_rate_lst = sorted(failing_rate_lst,
+                                   reverse=True)
+    answer = [sort_failing_rate_lst.index(i) + 1
+              for i in failing_rate_lst]
+    return answer
+
+# print(solution_mine(N_1, stages_1))
+# print(solution_mine(N_2, stages_2))
+
+def solution_best(N, stages):
+    answer = []
+
+    # 실패율 딕셔너리
+    result = {}
+
+    # 스테이지에 도달한 플레이어 수 = success_players / denominator : 분모
+    denominator = len(stages)
+
+    for stage in range(1, N + 1):
+        if denominator != 0:
+            failing_count = stages.count(stage)
+            result[stage] = failing_count / denominator
+            denominator -= failing_count
+        else:
+            result[stage] = 0
+    answer = sorted(result, key=lambda x: result[x], reverse=True)
+    return answer
+#
+# print(solution_best(N_1, stages_1))
+# print(solution_best(N_2, stages_2))

LEVEL2/Day2/PlusMinusAdd.py

@@ -0,0 +1,19 @@
+# 25. 음양 더하기
+
+def solution(absolutes, signs):
+    answer = 0
+
+    sum_lst = [absolutes[i] if signs[i] == True else -absolutes[i]
+               for i in range(len(signs))]
+
+    answer = sum(sum_lst)
+    return answer
+
+absolutes_1 = [4, 7, 12]
+absolutes_2 = [1, 2, 3]
+
+signs_1 = [True, False, True]
+signs_2 = [False, False, True]
+
+print(solution(absolutes_1, signs_1))
+print(solution(absolutes_2, signs_2))