feat: add solutions

Author: shinsj4653

clone-graph/shinsj4653.py

@@ -12,3 +12,39 @@
 
 """
 
+
+# Definition for a Node.
+class Node:
+    def __init__(self, val=0, neighbors=None):
+        self.val = val
+        self.neighbors = neighbors if neighbors is not None else []
+
+
+from typing import Optional
+from collections import deque
+
+
+class Solution:
+    def cloneGraph(self, node: Optional['Node']) -> Optional['Node']:
+
+        if not node:
+            return
+
+        clone = Node(node.val)
+        clones = {node: clone}
+
+        q = deque([node])  # 해당 라인 답지 참고
+
+        while q:
+            node = q.popleft()
+
+            for nei in node.neighbors:
+                if nei not in clones:
+                    clones[nei] = Node(nei.val)  # 답지 참고
+                    q.append(nei)
+
+                clones[node].neighbors.append(clones[nei])  # 답지 참고
+
+        return clone
+
+

longest-repeating-character-replacement/shinsj4653.py

@@ -11,4 +11,17 @@
 [회고]
 
 """
+class Solution:
+    def characterReplacement(self, s: str, k: int) -> int:
+        max_len = 0
+        counter = {}
+        start, end = 0, 0
+        while end < len(s):
+            counter[s[end]] = counter.get(s[end], 0) + 1
+            while end - start + 1 - max(counter.values()) > k:
+                counter[s[start]] -= 1
+                start += 1
+            max_len = max(end - start + 1, max_len)
+            end += 1
+        return max_len
 

reverse-bits/shinsj4653.py

@@ -13,3 +13,30 @@
 """
 
 
+class Solution:
+    def reverseBits(self, n: int) -> int:
+        st = []
+
+        # while n > 0:
+        #    st.append(n % 2)
+        #    n //= 2  => 32 bit 길이 맞춰야함!
+
+        while len(st) < 32:
+            print('st.append: ', n % 2)
+            st.append(n % 2)
+            n //= 2
+
+        ret, num = 0, 0
+        print("st: ", st)
+
+        # 6 : 110
+        # [0 1 1]
+
+        while st:
+            print('st.pop(): ', st[-1])
+            ret += st.pop() * (2 ** num)
+            num += 1
+
+        return ret
+
+