链表的部分反转

最新推荐文章于 2024-08-01 21:03:57 发布

Erice_s

最新推荐文章于 2024-08-01 21:03:57 发布

阅读量1.6k

点赞数 4

分类专栏： C/C++ 文章标签：链表算法数据结构

本文链接：https://blog.csdn.net/Erice_s/article/details/78488075

版权

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

45 篇文章 1 订阅

订阅专栏

链表的部分反转

题目要求：

给定一个链表，翻转该链表从m到n的位置。
要求直接翻转而非申请新空间
如：给定1→5→7→4→6→3→8→5，m=2，n=4，返回
1→4→7→5→6→3→8→5
假定给出的参数满足：1≤m≤n≤链表长度。

算法核心思想

pNext = pCur->pNext;
pCur->pNext = pHead->pNext;
pHead->pNext = pCur;
pre->pNext = pNext;
pCur = pNext;

代码段

代码块语法遵循标准C/C++代码

/*
* 问题描述：链表的部分反转
* C/C++ 语言
*
* @author Erice_s
* binbin_Erices@163.com
* @date 2017/11/9
*
*/
#include<iostream>
#include<time.h>

using namespace std;

typedef struct tagSNode
{
    int value;
    tagSNode *pNext;
    tagSNode(int v) :value(v), pNext(NULL){}
}SNode;

void Print(SNode*p)
{
    if (p == NULL)
    {
        cout << "Print failure：(p==NULL)\n";
        return;
    }
    p = p->pNext;
    while (p)
    {
        cout << p->value << " ";
        p = p->pNext;
    }
}

void Destroy(SNode*p)
{
    SNode *next;
    while (p)
    {
        next = p->pNext;
        delete p;
        p = next;
    }
}

int *Reserve(SNode *pHead, int from, int to)
{
    SNode *pCur = pHead->pNext;
    int i;
    for (i = 0; i < from - 1; i++)
    {
        pHead = pCur;
        pCur = pCur->pNext;
    }
    SNode *pre = pCur;
    pCur = pCur->pNext;
    to--;
    SNode *pNext;
    for (; i < to; i++)
    {
        pNext = pCur->pNext;
        pCur->pNext = pHead->pNext;
        pHead->pNext = pCur;
        pre->pNext = pNext;
        pCur = pNext;
    }

    return 0;
}


int main(void)
{
    SNode *pHead = new SNode(0);
    int i;
    time_t ts;
    srand((unsigned int)time(&ts));
    for (i = 0; i < 10; i++)
    {
        SNode *p = new SNode(rand() % 10);
        p->pNext = pHead->pNext;
        pHead->pNext = p;
    }
    Print(pHead);

    Reserve(pHead, 3, 6);

    cout << endl;
    Print(pHead);
    Destroy(pHead);

    system("pause");
    return 0;
}