feat: add python and java solutions to leetcode problem: No.0328

Author: yanglbme

README.md

@@ -66,6 +66,7 @@
 1. [旋转链表](/solution/0000-0099/0061.Rotate%20List/README.md)
 1. [回文链表](/solution/0200-0299/0234.Palindrome%20Linked%20List/README.md)
 1. [相交链表](/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/README.md)
+1. [奇偶链表](/solution/0300-0399/0328.Odd%20Even%20Linked%20List/README.md)
 1. [环形链表](/solution/0100-0199/0141.Linked%20List%20Cycle/README.md)
 1. [环形链表 II](/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README.md)
 

README_EN.md

@@ -64,6 +64,7 @@ Complete solutions to [LeetCode](https://leetcode-cn.com/problemset/all/), [LCOF
 1. [Rotate List](/solution/0000-0099/0061.Rotate%20List/README_EN.md)
 1. [Palindrome Linked List](/solution/0200-0299/0234.Palindrome%20Linked%20List/README_EN.md)
 1. [Intersection of Two Linked Lists](/solution/0100-0199/0160.Intersection%20of%20Two%20Linked%20Lists/README_EN.md)
+1. [Odd Even Linked List](/solution/0300-0399/0328.Odd%20Even%20Linked%20List/README_EN.md)
 1. [Linked List Cycle](/solution/0100-0199/0141.Linked%20List%20Cycle/README_EN.md)
 1. [Linked List Cycle II](/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README_EN.md)
 

solution/0300-0399/0328.Odd Even Linked List/README.md

@@ -45,6 +45,17 @@
 #         self.next = next
 class Solution:
     def oddEvenList(self, head: ListNode) -> ListNode:
+        if head is None:
+            return head
+        evenHead = head.next
+        odd, even = head, evenHead
+        while even and even.next:
+            odd.next = even.next
+            odd = odd.next
+            even.next = odd.next
+            even = even.next
+        odd.next = evenHead
+        return head
 ```
 
 ### **Java**
@@ -64,7 +75,19 @@ class Solution:
  */
 class Solution {
     public ListNode oddEvenList(ListNode head) {
-
+        if (head == null) {
+            return head;
+        }
+        ListNode evenHead = head.next;
+        ListNode odd = head, even = evenHead;
+        while (even != null && even.next != null) {
+            odd.next = even.next;
+            odd = odd.next;
+            even.next = odd.next;
+            even = even.next;
+        }
+        odd.next = evenHead;
+        return head;
     }
 }
 ```

solution/0300-0399/0328.Odd Even Linked List/README_EN.md

@@ -49,6 +49,17 @@
 #         self.next = next
 class Solution:
     def oddEvenList(self, head: ListNode) -> ListNode:
+        if head is None:
+            return head
+        evenHead = head.next
+        odd, even = head, evenHead
+        while even and even.next:
+            odd.next = even.next
+            odd = odd.next
+            even.next = odd.next
+            even = even.next
+        odd.next = evenHead
+        return head
 ```
 
 ### **Java**
@@ -66,7 +77,19 @@ class Solution:
  */
 class Solution {
     public ListNode oddEvenList(ListNode head) {
-
+        if (head == null) {
+            return head;
+        }
+        ListNode evenHead = head.next;
+        ListNode odd = head, even = evenHead;
+        while (even != null && even.next != null) {
+            odd.next = even.next;
+            odd = odd.next;
+            even.next = odd.next;
+            even = even.next;
+        }
+        odd.next = evenHead;
+        return head;
     }
 }
 ```

solution/0300-0399/0328.Odd Even Linked List/Solution.java

@@ -3,28 +3,25 @@
  * public class ListNode {
  *     int val;
  *     ListNode next;
- *     ListNode(int x) { val = x; }
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
  * }
  */
 class Solution {
     public ListNode oddEvenList(ListNode head) {
-        // 链表结点数小于 3,直接返回
-        if (head == null || head.next == null || head.next.next == null) {
+        if (head == null) {
             return head;
         }
-        ListNode dummy = new ListNode(-1);
-        dummy.next = head;
-        ListNode pre = head, t = pre.next, cur = t;
-        while (cur != null && cur.next != null) {
-            pre.next = cur.next;
-            cur.next = cur.next.next;
-            pre.next.next = t;
-            pre = pre.next;
-            // cur.next可能为空，所以在下一次循环要判断 cur != null 是否满足
-            cur = cur.next;
-            t = pre.next;
+        ListNode evenHead = head.next;
+        ListNode odd = head, even = evenHead;
+        while (even != null && even.next != null) {
+            odd.next = even.next;
+            odd = odd.next;
+            even.next = odd.next;
+            even = even.next;
         }
-        
-        return dummy.next;
+        odd.next = evenHead;
+        return head;
     }
 }

solution/0300-0399/0328.Odd Even Linked List/Solution.py

@@ -0,0 +1,18 @@
+# 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: ListNode) -> ListNode:
+        if head is None:
+            return head
+        evenHead = head.next
+        odd, even = head, evenHead
+        while even and even.next:
+            odd.next = even.next
+            odd = odd.next
+            even.next = odd.next
+            even = even.next
+        odd.next = evenHead
+        return head