Leetcode NO.86 Partition List

最新推荐文章于 2024-09-13 13:21:04 发布

lym1108csu

最新推荐文章于 2024-09-13 13:21:04 发布

阅读量430

点赞数

分类专栏： Leetcode 文章标签：算法 two pointer leetcode 链表

本文链接：https://blog.csdn.net/u012290414/article/details/42833039

版权

Leetcode 专栏收录该内容

140 篇文章 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) {

    	ListNode* smalllist = new ListNode(0);
    	ListNode* largelist = new ListNode(0);
        ListNode* smallhead = smalllist;
        ListNode* largehead = largelist;

        while (head != NULL) {
        	if (head->val < x) {
    			smalllist->next = head;
    			smalllist = smalllist->next;
        	}
        	else {
        		largelist->next = head;
        		largelist = largelist->next;
        	}
        	head = head->next;
        }
        largelist->next = NULL;
        smalllist->next = largehead->next;
        return smallhead->next;
    }
};

本质上就是再创建2个新的node，一个是small list，另外一个是large list，遍历原来的linked list，如果小于x则放在small list，反之放在large list。最后首尾相接构成新的linked list