@@ -0,0 +1,564 @@
+// Reverse a linked list from position m to n. Do it in-place and in one-pass.%0A%0A// For example:%0A// Given 1-%3E2-%3E3-%3E4-%3E5-%3ENULL, m = 2 and n = 4,%0A%0A// return 1-%3E4-%3E3-%3E2-%3E5-%3ENULL.%0A%0A// Note:%0A// Given m, n satisfy the following condition:%0A// 1 %E2%89%A4 m %E2%89%A4 n %E2%89%A4 length of list.%0A%0A/**%0A * Definition for singly-linked list.%0A * public class ListNode %7B%0A *     int val;%0A *     ListNode next;%0A *     ListNode(int x) %7B%0A *         val = x;%0A *         next = null;%0A *     %7D%0A * %7D%0A */%0Apublic class Solution %7B%0A    public ListNode reverseBetween(ListNode head, int m, int n) %7B%0A        %0A    %7D%0A%7D

add reverse linked list ii solution