翻转链表 II

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

样例

例1:

输入: 1->2->3->4->5->NULL, m = 2 and n = 4, 
输出: 1->4->3->2->5->NULL.

例2:

输入: 1->2->3->4->NULL, m = 2 and n = 3, 
输出: 1->3->2->4->NULL.

挑战

Reverse it in-place and in one-pass

注意事项

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

 

/**
 * Definition of singly-linked-list:
 * class ListNode {
 * public:
 *     int val;
 *     ListNode *next;
 *     ListNode(int val) {
 *        this->val = val;
 *        this->next = NULL;
 *     }
 * }
 */

class Solution {
public:
    /**
     * @param head: ListNode head is the head of the linked list 
     * @param m: An integer
     * @param n: An integer
     * @return: The head of the reversed ListNode
     */
    ListNode * reverseBetween(ListNode * head, int m, int n) 
    {
        // write your code here
        ListNode * ret = head;
        ListNode * myhead = head;
        ListNode * tail = NULL;
        int count = 0;
        for(int i = 0; i < m-1; i++)
        {
            myhead = myhead->next;
                
        }
        int chazhi = n - m;
       
        while(chazhi >= 1)
        {
            ListNode * tmp = myhead;
            for(int i = 0; i < chazhi; i++)
            {
                tmp = tmp->next;
                
            }
            
            int num = tmp->val;
            tmp->val = myhead->val;
            myhead->val = num;
            chazhi -= 2;
            myhead = myhead->next;
        }
    
        return ret;
        
        
    }
};