typedef struct LinkNode  
{  
    int data;  
    struct LinkNode* next;  
}LinkNode , *LinkList;  
  
LinkList inverseList(LinkList head)  
{  
    if(head == NULL || head->next == NULL)  
        return head;  
    LinkList pre = NULL;  
    LinkList curr = head;  
    LinkList next = NULL;  
  
    while(curr && curr->next)  
    {  
        if(pre)  
            pre->next = curr->next;  
        else  
            head = curr->next;  
  
        pre = curr;  
        next = curr->next->next;  
        curr->next->next = curr;  
        curr->next = next;  
        curr = next;   
    }  
    return head;  
}  

 

相关文章:

  • 2022-12-23
  • 2022-12-23
  • 2021-12-14
  • 2022-12-23
  • 2021-10-22
  • 2021-07-08
  • 2022-12-23
  • 2021-09-09
猜你喜欢
  • 2022-12-23
  • 2022-12-23
  • 2022-02-26
  • 2022-12-23
  • 2021-06-28
  • 2022-12-23
相关资源
相似解决方案