面试题 02.04:分割链表

LeetCode/src/main/java/leetcode/editor/cn/PartitionListLcci.java

@@ -0,0 +1,51 @@
+//编写程序以 x 为基准分割链表，使得所有小于 x 的节点排在大于或等于 x 的节点之前。如果链表中包含 x，x 只需出现在小于 x 的元素之后(如下所示)。
+//分割元素 x 只需处于“右半部分”即可，其不需要被置于左右两部分之间。 
+//
+// 示例: 
+//
+// 输入: head = 3->5->8->5->10->2->1, x = 5
+//输出: 3->1->2->10->5->5->8
+// 
+// Related Topics 链表 双指针 
+// 👍 54 👎 0
+
+package leetcode.editor.cn;
+
+import com.code.leet.entiy.ListNode;
+
+//面试题 02.04:分割链表
+public class PartitionListLcci {
+    public static void main(String[] args) {
+        //测试代码
+        Solution solution = new PartitionListLcci().new Solution();
+    }
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+
+    /**
+     * Definition for singly-linked list.
+     * public class ListNode {
+     * int val;
+     * ListNode next;
+     * ListNode(int x) { val = x; }
+     * }
+     */
+    class Solution {
+        public ListNode partition(ListNode head, int x) {
+            ListNode temp = head;
+            ListNode current;
+            while (temp != null) {
+                while (temp.next != null && temp.next.val < x) {
+                    current = temp.next;
+                    temp.next = current.next;
+                    current.next = head;
+                    head = current;
+                }
+                temp = temp.next;
+            }
+            return head;
+        }
+    }
+//leetcode submit region end(Prohibit modification and deletion)
+
+}