leetcode: finished #328

content/leetcode/2023/9.md

@@ -3,6 +3,49 @@ title: 2023.9
 draft: false
 ---
 
+# 2023.9.10
+
+```python
+#
+# @lc app=leetcode.cn id=328 lang=python3
+#
+# [328] 奇偶链表
+#
+
+from typing import Optional
+
+
+class ListNode:
+    def __init__(self, val=0, next=None):
+        self.val = val
+        self.next = next
+
+
+# @lc code=start
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+class Solution:
+    def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:
+        if not head:
+            return head
+        odd, even = head, head.next
+        evenHead = even
+        while even and even.next:
+            odd.next = even.next
+            even.next = even.next.next
+            odd = odd.next
+            even = even.next
+
+        odd.next = evenHead
+        return head
+
+
+# @lc code=end
+```
+
 # 2023.9.9
 
 ```python