翻转链表

public class Solution {
    /**
     * @param head: The head of linked list.
     * @return: The new head of reversed linked list.
     */
    public ListNode reverse(ListNode head) {
        // write your code here
        ListNode pre=null;
        while(head!=null){
            ListNode next = head.next;
            head.next = pre;
            pre = head;
            head = next;
        }
        return pre;
    }
}

扩展：翻转链表中第m个节点到第n个节点的部分

样例：给出链表1->2->3->4->5->null， m = 2 和n = 4，返回1->4->3->2->5->null

注意

m，n满足1 ≤ m ≤ n ≤ 链表长度

/**
 * Definition for ListNode
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @param ListNode head is the head of the linked list 
     * @oaram m and n
     * @return: The head of the reversed ListNode
     */
    public ListNode reverseBetween(ListNode head, int m , int n) {
        // write your code
        ListNode dummy = new ListNode(0);
        dummy.next = head;
        //使得head到达m的前一个结点
        head = dummy;
        for(int i=0;i<m-1;i++){
            head=head.next;
        }
        //使得end到达n的下一个结点
        ListNode end = dummy;
        for(int i=0;i<n+1;i++){
            end=end.next;
        }
        //reverse
        ListNode pre = end;
        ListNode cur = head.next;
        while(cur!=end){
            ListNode next = cur.next;
            cur.next = pre;
            pre = cur;
            cur = next;
        }
        head.next = pre;
        return dummy.next;
    }
}