leetcode.com 86. Partition List

문제 링크: https://leetcode.com/problems/partition-list

Author: skysign

leetcode.com 86. Partition List/main.py

@@ -0,0 +1,34 @@
+from typing import Optional
+
+
+# Definition for singly-linked list.
+class ListNode:
+    def __init__(self, val=0, next=None):
+        self.val = val
+        self.next = next
+
+
+class Solution:
+    def partition(self, head: Optional[ListNode], x: int) -> Optional[ListNode]:
+        lessthan_x = ListNode(-201, None)
+        greaterthanorequal_x = ListNode(201, None)
+        lx, gx = lessthan_x, greaterthanorequal_x
+
+        node = head
+
+        while node:
+            tmp = node
+            node = node.next
+
+            if tmp.val < x:
+                lx.next = tmp
+                lx = tmp
+                lx.next = None
+            else:
+                gx.next = tmp
+                gx = tmp
+                gx.next = None
+
+        lx.next = greaterthanorequal_x.next
+
+        return lessthan_x.next

leetcode.com 86. Partition List/test_main.py

@@ -0,0 +1,7 @@
+from unittest import TestCase
+from main import Solution
+
+class TestSolution(TestCase):
+    def test1_partition(self):
+        sln = Solution()
+        head = ListNode