leetcode: Partition List

504 篇文章 0 订阅
230 篇文章 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 tox.

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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (head == NULL)
            return NULL;
        
        ListNode* pSHead = NULL;
        ListNode* pBHead = NULL;
        
        ListNode* pSPre  = NULL;
        ListNode* pBPre  = NULL;
        
        ListNode* pCur = head;
        
        while (pCur)
        {
            if (pCur->val < x)
            {
                if (pSHead == NULL)
                {
                    pSHead = pCur;
                    pSPre  = pCur;
                }
                else
                {
                    pSPre->next = pCur;
                    pSPre = pCur;
                }
            }
            else
            {
                if (pBHead == NULL)
                {
                    pBHead = pCur;
                    pBPre  = pCur;
                }
                else
                {
                    pBPre->next = pCur;
                    pBPre = pCur;
                }
            }
            pCur = pCur->next;
        }
        
        if (pSHead == NULL)
            return pBHead;
            
        if (pBHead == NULL)
            return pSHead;
            
        pBPre->next = NULL;    
        pSPre->next = pBHead;
        
        return pSHead;
    }
};


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值