分隔链表 · 交互式算法学习

这是一组同题正确实现，独立于上方当前动画方法；不同语言可能采用另一种正确策略。

1/**2 * Definition for singly-linked list.3 * public class ListNode {4 *     int val;5 *     ListNode next;6 *     ListNode() {}7 *     ListNode(int val) { this.val = val; }8 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }9 * }10 */11class Solution {12    public ListNode partition(ListNode head, int x) {13        ListNode l = new ListNode();14        ListNode r = new ListNode();15        ListNode tl = l, tr = r;16        for (; head != null; head = head.next) {17            if (head.val < x) {18                tl.next = head;19                tl = tl.next;20            } else {21                tr.next = head;22                tr = tr.next;23            }24        }25        tr.next = null;26        tl.next = r.next;27        return l.next;28    }29}