@@ -0,0 +1,767 @@
+/**%0A * Definition for singly-linked list.%0A * public class ListNode %7B%0A *     int val;%0A *     ListNode next;%0A *     ListNode(int x) %7B val = x; %7D%0A * %7D%0A */%0Apublic class Solution %7B%0A    public ListNode reverseBetween(ListNode head, int m, int n) %7B%0A        if(m == n)%7B%0A            return head;%0A        %7D%0A        ListNode newHead = new ListNode(0);%0A        newHead.next = head; head = newHead;%0A        ListNode flag;%0A        m--;n--;%0A        while(m %3E 0)%7B%0A            head = head.next;%0A            m--;n--;%0A        %7D%0A        flag = head;%0A        head = head.next;%0A        while(n-- %3E 0)%7B%0A            ListNode tmp = head.next;%0A            head.next = head.next.next;%0A            tmp.next = flag.next;%0A            flag.next = tmp;%0A        %7D%0A        return newHead.next;%0A    %7D%0A%7D

Q92 Reverse Linked List II