[leetcode]partition-list 分隔链表
. - 力扣（LeetCode）
class Solution {
public:ListNode* partition(ListNode* head, int x) {ListNode *smlDummy = new ListNode(0), *bigDummy = new ListNode(0);ListNode *sml = smlDummy, *big = bigDummy;while (head != nullptr) {if (head->val < x) {sml->next = head;sml = sml->next;} else {big->next = head;big = big->next;}head = head->next;}sml->next = bigDummy->next;big->next = nullptr;return smlDummy->next;}
};