LeetCode_Partition List

最新推荐文章于 2015-09-02 10:19:11 发布

shengno1

最新推荐文章于 2015-09-02 10:19:11 发布

阅读量848

点赞数

分类专栏： Algorithms Leetcode Something_Interesting C++ xOJ_Coding 文章标签： C++ algorithm 算法 leetcode

本文链接：https://blog.csdn.net/sheng_ai/article/details/45042429

版权

Something_Interesting 同时被 3 个专栏收录

174 篇文章 0 订阅

订阅专栏

C++

88 篇文章 0 订阅

订阅专栏

Algorithms

47 篇文章 0 订阅

订阅专栏

一.题目

Partition List

Total Accepted: 34348 Total Submissions: 124815 My Submissions

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.

Show Tags

Have you met this question in a real interview?

Yes

Discuss

二.解题技巧

这道题是一个普通的链表遍历的题目，需要注意的地方在于必须将链表的最后一个节点的下一个节点更新为null，不然链表会出现环，从而导致死循环的情况。

三.实现代码

/**
* Definition for singly-linked list.
* struct ListNode {
*     int val;
*     ListNode *next;
*     ListNode(int x) : val(x), next(NULL) {}
* };
*/


#include <iostream>

struct ListNode
{
    int val;
    ListNode *next;
    ListNode(int x) : val(x), next(NULL) {}
};


class Solution
{
public:
    ListNode *partition(ListNode *head, int x)
    {
        ListNode *LessHeader = new ListNode(10);
        ListNode *LessTail = LessHeader;

        ListNode *GreaterHeader = new ListNode(10);
        ListNode *GreaterTail = GreaterHeader;

        while(head != NULL)
        {
            if (head->val < x)
            {
                LessTail->next = head;
                LessTail = head;
            }
            else
            {
                GreaterTail->next = head;
                GreaterTail = head;
            }

            head = head->next;
        }

        LessTail->next = GreaterHeader->next;
        GreaterTail->next = NULL;
        delete GreaterHeader;

        head = LessHeader->next;
        delete LessHeader;

        return head;
    }
};


void Test()
{
    ListNode *head = new ListNode(2);
    head->next = new ListNode(1);
    int x = 2;

    Solution S1;
    ListNode *Result = S1.partition(head, x);

    while (Result != NULL)
    {
        std::cout << "The result is " << Result->val << std::endl;
        Result = Result->next;
    }



}