leetcode-Partition List
来源:互联网 发布:小猫多少钱一只淘宝网 编辑:程序博客网 时间:2024/06/05 01:18
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
.
思路:三个指针记录位置:p:插入位置的前一个结点,pre: q的前一个结点;q:遍历结点
当q->val小于x时,插入,插入头结点前面时需进行特殊处理
否则,向前遍历。
代码:
ListNode *partition(ListNode *head, int x) {
ListNode *p=NULL;
ListNode *q=head;
ListNode *pre=NULL;
while(q != NULL)
{
if(q->val < x)
{
if(p==NULL)
{
if(head->val>=x)
{
pre->next=q->next;
q->next=head;
head=q;
q=pre->next;
p=head;
}
else
{
pre=q;
q=q->next;
}
}
else
{
pre->next=q->next;
q->next=p->next;
p->next=q;
q=pre->next;
p=p->next;
}
}
else
{
if(pre!=NULL && pre->val<x)
{
p=pre;
}
pre=q;
q=q->next;
}
}
return head;
}
- LeetCode: Partition List
- LeetCode Partition List
- LeetCode: Partition List
- [Leetcode] Partition List **
- [Leetcode] Partition List
- [LeetCode] Partition List
- leetcode 81: Partition List
- [Leetcode] Partition List
- leetcode 118: Partition List
- [LeetCode]Partition List
- [leetcode]Partition List
- LeetCode-Partition List
- [leetcode] Partition List
- LeetCode - Partition List
- [LeetCode] Partition List
- LeetCode 86: Partition List
- LeetCode:Partition List
- 【leetcode】Partition List
- 【转】quick-cocos2d-x数据存储之GameState
- 驱动开发之 驱动设备名称,符号连接名,以及应用程序打开设备
- 团队管理的一些总结
- leetcode:Longest Consecutive Sequence
- gcc 与 glibc 的关系 glibc版本查看
- leetcode-Partition List
- [leetcode] Sort List
- 从git版本库中移出文件但不删除
- android文件读写总结
- OpenCV学习笔记6 OpenCV核心模块与核心功能Core Module & Core Functionality(五)
- 如何组织论文
- Adobe Audition剪辑音乐片段
- 做iOS开发我为什么弃用Objective-C而选择RubyMotion?
- CentOS6.5上安装qt-creator-opensource-linux-x86-3.1.2.run