反转链表以及反转链表进阶备忘

最新推荐文章于 2025-07-23 14:10:46 发布

fangxubz

最新推荐文章于 2025-07-23 14:10:46 发布

阅读量575

点赞数

CC 4.0 BY-SA版权

分类专栏：其他文章标签：备忘 c 链表

本文链接：https://blog.youkuaiyun.com/u011437680/article/details/46672911

其他专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一种使用C++实现的链表及其反转的方法，并进一步实现了按特定数量节点进行分组反转的功能。文中提供了完整的代码示例，包括初始化链表、基本的链表反转及更复杂的分组反转等操作。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include<iostream>
#include<cstdio>
using namespace std;

typedef struct node{
    int data;
    struct node *next;
}LinkNode;

LinkNode* init()
{
    LinkNode *head = new LinkNode;
    LinkNode *p, *q;
    p = head;
    int data;
    while(scanf("%d", &data) != EOF && data != -1)
    {
        q = new LinkNode;
        q->data = data;
        p->next = q;
        p = q; 
    }
    p->next = NULL;
    return head->next;
}

LinkNode *reverse(LinkNode *head)
{
    if(head && head->next)
    {
        LinkNode *p1 = head;
        LinkNode *p2 = head->next;
        LinkNode *p3;
        while(p2)
        {
            p3 = p2->next;
            p2->next = p1;
            p1 = p2;
            p2 = p3;
        }
        head->next = NULL;
        head = p1;
        return head;
        
    }
    else{
        return head;
    }
}

LinkNode* reversePlus(LinkNode* head, int k)
{
    if(head && head->next)
    {
        LinkNode *cur = head;
        LinkNode *nextHead;
        int count = 1;
        while(cur && count < k)
        {
            count++;
            cur = cur->next;
        }
        if(cur == NULL)
            return head;
        else{
            nextHead = cur->next;
        }
        LinkNode *p1 = head;
        LinkNode *p2 = p1->next;
        LinkNode *p3;
        count = 1;
        while(p2 && count < k)
        {
            p3 = p2->next;
            p2->next = p1;
            p1 = p2;
            p2 = p3;
            count++;
        }
        head->next = reversePlus(nextHead, k);
        head = p1;
        return head;
    }
    else
        return head;
}

void OutPut(LinkNode *head)
{
    LinkNode *p = head;
    while(p)
    {
        printf("%d ", p->data);
        p = p->next;
    }
    printf("\n");
}

int main()
{
    LinkNode *newnode = init();
    OutPut(newnode);
    newnode = reverse(newnode);
    OutPut(newnode);
    newnode = reversePlus(newnode, 3);
    OutPut(newnode);
    return 0;
}