leetcode_92_Reverse Linked List II

描述：

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.

思路：

代碼：

public ListNode reverseBetween(ListNode head, int m, int n) {
		if (head==null) {
			return null;
		}
        ListNode p =head,q=head,temp=null;
        int i=0;
        for(i=0;i




結果：