LeetCode Partition List

最新推荐文章于 2019-07-16 09:33:43 发布

kassical

最新推荐文章于 2019-07-16 09:33:43 发布

阅读量420

点赞数

分类专栏： LeetCode 文章标签： leetcode 链表

本文链接：https://blog.csdn.net/kassical/article/details/38764143

版权

LeetCode 专栏收录该内容

98 篇文章 0 订阅

订阅专栏

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.

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) {
		if (head == NULL || head->next == NULL)
			return head;
		ListNode lessx(0), greaterx(0);
		ListNode *pless = &lessx, *pgreater = &greaterx;
		while (head) {
			if (head->val < x) {
				pless->next = head;
				pless = head;
			}
			else {
				pgreater->next = head;
				pgreater = head;
			}
			head = head->next;
		}
		pless->next = greaterx.next;
		pgreater->next = NULL;
		return lessx.next;
	}
};