Reversing Linked List

Reversing Linked List（25 分）
Given a constant K and a singly linked list L, you are supposed to reverse the links of every K elements on L. For example, given L being 1→2→3→4→5→6, if K=3, then you must output 3→2→1→6→5→4; if K=4, you must output 4→3→2→1→5→6.

Input Specification:

Each input file contains one test case. For each case, the first line contains the address of the first node, a positive N (≤10
​5
​​ ) which is the total number of nodes, and a positive K (≤N) which is the length of the sublist to be reversed. The address of a node is a 5-digit nonnegative integer, and NULL is represented by -1.

Then N lines follow, each describes a node in the format:

Address Data Next
where Address is the position of the node, Data is an integer, and Next is the position of the next node.

Output Specification:

For each case, output the resulting ordered linked list. Each node occupies a line, and is printed in the same format as in the input.

Sample Input:

00100 6 4
00000 4 99999
00100 1 12309
68237 6 -1
33218 3 00000
99999 5 68237
12309 2 33218
Sample Output:

00000 4 33218
33218 3 12309
12309 2 00100
00100 1 99999
99999 5 68237
68237 6 -1

分析;

• 这道题目意思,其实是让我们模拟指针在内存里的,情况:

• 如随意输入一个元素:
  33218 3 12309:

  node ///使用顺序表存储data和下一地址next
  {
  int data==3;
  int next==12309;

  他自己的地址是:33218,他的值是data=3;他作为一个指针指向:12309的地址:
  首先给出答案正确,但是和出题者意思不符合的解题;

#include<iostream>  
#include<stdio.h>  
#include<algorithm>    ///使用到reverse 翻转函数  
using namespace std;  

#define MAXSIZE 1000010   ///最大为五位数的地址  

struct node    ///使用顺序表存储data和下一地址next  
{  
   int data;     
   int next;  
}node[MAXSIZE];  

int List[MAXSIZE];   ///存储可以连接上的顺序表  


void myreverse(int * i1,int * i2){
    int count = i2-i1;
    int list[count];
    for(int i=0;i<count;i++){
        list[i]=*i1; 
        i1++;
    }
    for(int i=0;i<count;i++){
        *i2 = list[i]; 
        i2--; 
    }
}

int main()  
{  
    int First, n, k;    //    k 是要倒叙的位置长度
    cin>>First>>n>>k;   ///输入头地址 和 n，k； 

    int Address,Data,Next;  
    for(int i=0;i<n;i++)  
    {  
        cin>>Address>>Data>>Next;  
        node[Address].data=Data;  
        node[Address].next=Next;  
    }  

    int j=0;  ///j用来存储能够首尾相连的节点数  
    int p=First;   ///p指示当前结点  

    while(p!=-1)  
    {  
        List[j++]=p;  
        p=node[p].next;  
    }  

    int i =0; 
    while(i+k<=j)   ///每k个节点做一次翻转  
    {  
        reverse(&List[i],&List[i+k]);  
        i=i+k;  
    }  

    for(i=0;i<j-1;i++)  
        printf("%05d %d %05d\n",List[i],node[List[i]].data,List[i+1]);  
    printf("%05d %d -1\n",List[i],node[List[i]].data);  
    return 0;  
}  

## 原因在于,他在翻转输出的时候,并不是真实的模拟了翻转.仅仅是答案正确了##

以下是最佳答案:

struct node ///使用顺序表存储data和下一地址next
{
int data;
int next;
}node[MAXSIZE];

这里我们开辟了足够大的内存,数组对应位置上,data代表数组,next代表指向的指针;

以上是我们翻转四个需要的东东;

Ptr Reverse(Ptr had,int K)
{
    cnt =1;
    new = head->next;
    old = new ->next;
    while(cnt<K){
        tmp = old->next;

        old->next = new;
        new = old;
        old = tmp;
        cnt++;
    }
    head ->next ->next =old;
    head ->next = new;
    return new
}