leetcode 86

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.

Subscribe to see which companies asked this question.

思路：

链表尽量不要不断地new。。。

边界：null

扫一遍 large/small,分为两个链表最后合并：记得将大的最后赋值为NULL

/**
 * 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 == NULL)
            return NULL;
        ListNode* small = new ListNode(0);
        ListNode* s_h = small;
        ListNode* large = new ListNode(0);
        ListNode* l_h = large;
        while (head != NULL)
        {
            if (head -> val >= x)
            {
                large -> next = head;
                large = large -> next;
                //large -> next = NULL;
            }
            else
            {
                small -> next = head;
                small = small -> next; 
            }
            head = head -> next;
        }
        large -> next = NULL;
        small -> next = l_h ->next;
        return s_h -> next;
    }
    
};