LeetCode OJ 92. Reverse Linked List II

最新推荐文章于 2019-01-11 02:14:53 发布

weixin_30326745

最新推荐文章于 2019-01-11 02:14:53 发布

阅读量72

点赞数

原文链接：http://www.cnblogs.com/YuNanlong/p/6058573.html

版权

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.

Subscribe to see which companies asked this question

解答：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* reverseBetween(struct ListNode* head, int m, int n) {
    struct ListNode *pNode = head, *tmp_1, *tmp_2, *tmp_head = NULL, *tmp_tail;
    int count = 0;
    
    if(1 != m){
        while(NULL != pNode){
            count++;
            if(m - 1 == count){
                tmp_tail = tmp_1 = pNode->next;
                pNode->next = NULL;
                while(n > count){
                    tmp_2 = tmp_1->next;
                    tmp_1->next = pNode->next;
                    pNode->next = tmp_1;
                    tmp_1 = tmp_2;
                    count++;
                }
                tmp_tail->next = tmp_1;
                break;
            }
            pNode = pNode->next;
        }
    }
    else{
        tmp_tail = head;
        while(n > count){
            tmp_2 = head->next;
            head->next = tmp_head;
            tmp_head = head;
            head = tmp_2;
            count++;
        }
        tmp_tail->next = head;
        head = tmp_head;
    }
    return head;
}