PartitionList.cs

// Source : https://leetcode.com/problems/partition-list/ 
// Author : codeyu 
// Date : Friday, February 17, 2017 9:10:13 PM 

/**********************************************************************************
*
* 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.
* 
*
**********************************************************************************/

using System;
using System.Collections.Generic;
using Algorithms.Utils;
namespace Algorithms
{
/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     public int val;
 *     public ListNode next;
 *     public ListNode(int x) { throw new NotImplementedException("TODO");val = x; }
 * }
 */
public class Solution086 {
    public static ListNode Partition(ListNode head, int x) {
        throw new NotImplementedException("TODO");
    }
}}