Partition List

Posted 飘舞的雪

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Partition List相关的知识,希望对你有一定的参考价值。

描述:

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. 

代码:

class Solution {

public:

  ListNode *partition(ListNode *head, int x) {

    ListNode left_dummy(-1);  //头结点

    ListNode right_dummy(-1);  //头结点

    ListNode *left_cur = &left_dummy;

    ListNode *right_cur = &right_dummy;

    for (ListNode *cur = head; cur; cur = cur->next) {

      if (cur->val < x) {

        left_cur->next = cur;

        left_cur = cur;

      }

      else {

        right_cur->next = cur;

        right_cur = cur;

      }

    }

    left_cur->next = right_dummy.next;

    right_cur->next = NULL;

    return left_dummy.next; 

  }

};

以上是关于Partition List的主要内容,如果未能解决你的问题,请参考以下文章

Topic与Partition

【SQL】partition by

[Oracle][Partition][Controlfile]Partition 操作是否和 Controlfile有关?

[Oacle][Partition]Partition操作与 Index, Global Index 的关系

实现 partition_unique 和 stable_partition_unique 算法

oracle用partition by