【C语言】链表内指定区间反转

最新推荐文章于 2022-07-21 21:39:14 发布

ShuchongLI

最新推荐文章于 2022-07-21 21:39:14 发布

阅读量408

点赞数

分类专栏： C/C++ 文章标签：链表 c语言数据结构

本文链接：https://blog.csdn.net/harry_666/article/details/125093801

版权

C/C++ 专栏收录该内容

12 篇文章 1 订阅

订阅专栏

问题描述

在这里插入图片描述

核心代码

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 * };
 */
struct ListNode* reverseBetween(struct ListNode* pHead, int m, int n ) {
    /*
        check input error
    */
    if(m>n){
        printf("m can not greater than b");
        exit(0);
    }
    else if(m > 1000){
        printf("m can not greater than 1000");
        exit(0);
    }
    else if(n > 1000){
        printf("n can not greater than 1000");
        exit(0);
    }
    
    struct ListNode* testNode = pHead;
    
    int sum = 0;
    do{
        if(testNode->val > 1000){
            printf("node val can not greater than 1000");
            exit(0);            
        }
        testNode = testNode->next;
        sum ++;
    }
    while(testNode != NULL);
    
    if(sum > 1000){
         printf("chian length can not greater than 1000");
         exit(0); 
    }
    /*
        main code
     */
    if(pHead == NULL || pHead->next == NULL || m == n)
        return pHead;
    
    struct ListNode* before_startNode = NULL;
    struct ListNode* startNode = pHead;
    struct ListNode* endNode = pHead;
    
    //find the start and the end of the interval
    for(int i = 1;i<m;i++){
        before_startNode = startNode;
        startNode = startNode->next;
    }
    for(int i = 1;i<n;i++){
        endNode = endNode->next;
    }
    
    struct ListNode* beforeNode = startNode;
    struct ListNode* Node = startNode->next;
    struct ListNode* afterNode = startNode->next->next;
    
    //handle the begin and the end
    if(pHead==startNode)
        pHead = endNode;
    else
        before_startNode->next = endNode;
    if(endNode->next == NULL);
    
        
    //only 2 elements in this interval
    if(Node == endNode){
        startNode->next = endNode->next;
        endNode->next = startNode;
    }
    //inverse the interval
    for(int i = 1;i<n-m;i++){
        //reach the end of this ineterval
        if(afterNode == endNode){
            startNode->next = endNode->next;
            endNode->next = Node;            
        }
        
        //do the inversion
        Node->next = beforeNode;
        
        //panning the nodes
        beforeNode = Node;
        Node = afterNode;
        afterNode = afterNode->next;
    }

    return pHead;
}