ReverseLinkedListII.cs

// Source : https://leetcode.com/problems/reverse-linked-list-ii 
// Author : codeyu 
// Date : Thursday, March 9, 2017 11:27:05 PM 

/**********************************************************************************
*
* 
* Reverse a linked list from position m to n. Do it in-place and in one-pass.
* 
* 
* 
* For example:
* Given 1->2->3->4->5->NULL, m = 2 and n = 4,
* 
* 
* return 1->4->3->2->5->NULL.
* 
* 
* Note:
* Given m, n satisfy the following condition:
* 1 ? m ? n ? length of list.
* 
*
**********************************************************************************/

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) { val = x; }
 * }
 */
public class Solution092 {
    public static ListNode ReverseBetween(ListNode head, int m, int n) {
        throw new NotImplementedException("TODO");
    }
}}