solve 0122

Author: peacecheejecake

peacecheejecake/programmers/.idea/.gitignore

@@ -0,0 +1,11 @@
+def solution(phone_book):
+    n = len(phone_book)
+    memo = [""] * n
+    for l in range(20):
+        for i in range(n):
+            memo[i] += phone_book[l]
+
+        if len(set(memo)) < n:
+            return False
+
+    return True

peacecheejecake/programmers/.idea/inspectionProfiles/profiles_settings.xml

@@ -0,0 +1,16 @@
+from collections import deque
+
+
+def solution(priorities, location):
+    q = deque([
+        (p, i == location) for i, p in enumerate(priorities)
+    ])
+    cnt = 0
+    while q:
+        head, is_mine = q.popleft()
+        if q and max(t[0] for t in q) > head:
+            q.append((head, is_mine))
+        else:
+            cnt += 1
+            if is_mine:
+                return cnt

peacecheejecake/programmers/.idea/misc.xml

@@ -26,3 +26,34 @@ def search(place):
 
 def solution(places):
     return [search(place) for place in places]
+
+# ### 📌 푼 문제들
+
+# - [거리두기 확인하기](https://programmers.co.kr/learn/courses/30/lessons/81302)
+# - [수식 최대화](https://programmers.co.kr/learn/courses/30/lessons/67257#)
+# - [튜플](https://programmers.co.kr/learn/courses/30/lessons/64065)
+
+# ---
+
+# ### 📝 간단한 풀이 과정
+
+# #### 거리두기 확인하기
+
+# - 모든 자리를 검사하면서, 응시자가 있는 경우 아래 순서로 검사합니다.
+#   - 바로 옆 칸(맨해튼 거리=1)
+
+# #### 문제 2 
+
+# - 풀이과정
+
+# #### 문제 3
+
+# - 풀이과정
+
+# ---
+
+# ### 🙌 궁금한 점
+
+# - 궁금한 점이 있을 경우 적어주시고 없을 경우 지워주세요.
+
+# ---

peacecheejecake/programmers/.idea/modules.xml

@@ -0,0 +1,6 @@
+def solution(grid):
+    n = len(grid)
+    visited = [[[False] * 4 for _ in range(n)] for _ in range(n)]
+
+    # def search_cycle(si, sj):
+    #     for dir_idx in range(4):