题目简介
编写代码,以给定值x为基准将链表分割成两部分,所有小于x的结点排在大于或等于x的结点之前
给定一个链表的头指针 ListNode* pHead,请返回重新排列后的链表的头指针。注意:分割以后保持原来的数据顺序不变。
牛客
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};*/
class Partition {
public:
ListNode* partition(ListNode* pHead, int x) {
// write code here
ListNode* lesshead = NULL;
ListNode* lesstail = NULL;
ListNode* greathead = NULL;
ListNode* greattail = NULL;
lesshead = lesstail =(ListNode*)malloc(sizeof(ListNode));
greathead = greattail =(ListNode*)malloc(sizeof(ListNode));
ListNode* cur = pHead;
while(cur)
{
if(cur->val < x)
{
lesstail->next = cur;
lesstail = cur;
}
else
{
greattail->next = cur;
greattail = cur;
}
cur = cur->next;
}
greattail->next = NULL;
lesstail->next = greathead->next;
ListNode* list = lesshead->next;
free(lesshead);
free(greathead);
return list;
}
};