LeetCode|86.区间链表

Partition List 问题描述 Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.
【LeetCode|86.区间链表】You should preserve the original relative order of the nodes in each of the two partitions.
For example,
Given 1->4->3->2->5->2 and x = 3,
return 1->2->2->4->3->5.
参考答案

/** * Definition for singly-linked list. * struct ListNode { *int val; *ListNode *next; *ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode* partition(ListNode* head, int x) { ListNode node1(0),node2(0); ListNode *p1 = &node1, *p2 = &node2; while(head){ if(head->valnext = head; else p2 = p2->next = head; head = head->next; } p2->next = NULL; p1->next = node2.next; return node1.next; } };

性能: LeetCode|86.区间链表
文章图片

    推荐阅读