【LeetCode】Partition List

Snowwolf_Yang

于 2014-08-16 23:42:07 发布

阅读量477

点赞数

分类专栏： LeetCode 链表

本文链接：https://blog.csdn.net/snowwolf_yang/article/details/38622919

版权

LeetCode 同时被 2 个专栏收录

86 篇文章 0 订阅

订阅专栏

链表

12 篇文章 0 订阅

订阅专栏

Partition List

Total Accepted: 14597 Total Submissions: 54894 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.

这类问题，使用两个链表思路会清晰

/**
 * 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) {
        if (!head || !(head->next)) return head;
        ListNode *head_left = NULL, *tail_left = NULL, *head_right = NULL, *tail_right = NULL;
        ListNode *p = head, *q = NULL;
        while (p) {
            q = p->next;
            if (p->val < x) {
                if(!head_left) {
                    head_left = p;
                } else {
                    tail_left->next = p;
                }
                tail_left = p;
                tail_left->next = NULL;
            } else {
                if(!head_right) {
                    head_right = p;
                } else {
                    tail_right->next = p;
                }
                tail_right = p;
                tail_right->next = NULL;
            }
            p = q;
        }
        if (tail_left) {/
            tail_left->next = head_right;
            return head_left;
        } else {
            return head_right;
        }
    }
};