2020-04-01

Author: JiayangWu

1111.有效括号的嵌套深度/1111-有效括号的嵌套深度.py

@@ -0,0 +1,17 @@
+class Solution(object):
+    def maxDepthAfterSplit(self, seq):
+        """
+        :type seq: str
+        :rtype: List[int]
+        """
+        par_cnt = 0
+        res = [0 for _ in seq]
+        
+        for i, par in enumerate(seq):
+            if par == "(":
+                par_cnt += 1
+                res[i] = par_cnt % 2
+            else:
+                res[i] = par_cnt % 2
+                par_cnt -= 1
+        return res

面试题 01.09.字符串轮转/面试题 01.09-字符串轮转.py

@@ -0,0 +1,8 @@
+class Solution(object):
+    def isFlipedString(self, s1, s2):
+        """
+        :type s1: str
+        :type s2: str
+        :rtype: bool
+        """
+        return s1 in s2 + s2 and len(s1) == len(s2)

面试题 02.01.移除重复节点/面试题 02.01-移除重复节点.py

@@ -0,0 +1,26 @@
+# Definition for singly-linked list.
+# class ListNode(object):
+#     def __init__(self, x):
+#         self.val = x
+#         self.next = None
+
+class Solution(object):
+    def removeDuplicateNodes(self, head):
+        """
+        :type head: ListNode
+        :rtype: ListNode
+        """
+        visited = set()
+        
+        p = head
+        pre = None
+        while p:
+            if p.val in visited:
+                pre.next = p.next
+                p = p.next
+            else:
+                visited.add(p.val)
+                pre = p
+                p = p.next
+        return head
+                

面试题 02.02.返回倒数第k个节点/面试题 02.02-返回倒数第k个节点.py

@@ -0,0 +1,22 @@
+# Definition for singly-linked list.
+# class ListNode(object):
+#     def __init__(self, x):
+#         self.val = x
+#         self.next = None
+
+class Solution(object):
+    def kthToLast(self, head, k):
+        """
+        :type head: ListNode
+        :type k: int
+        :rtype: int
+        """
+        slow, fast = head, head
+        while k:
+            k -= 1
+            fast = fast.next
+            
+        while fast:
+            slow = slow.next
+            fast = fast.next
+        return slow.val

面试题 02.03.删除中间节点/面试题 02.03-删除中间节点.py

@@ -0,0 +1,19 @@
+# Definition for singly-linked list.
+# class ListNode(object):
+#     def __init__(self, x):
+#         self.val = x
+#         self.next = None
+
+class Solution(object):
+    def deleteNode(self, node):
+        """
+        :type node: ListNode
+        :rtype: void Do not return anything, modify node in-place instead.
+        """
+        p = node
+        while p and p.next:
+            p.val = p.next.val
+            if not p.next.next:
+                p.next = None
+            p = p.next
+