练习题目总结 Reversing Linked List（C++）

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

本程序目前仍有不足，改日再改hh
主要解决有多余结点不在链表上问题。

#include<iostream>
#include<iomanip>
using namespace std;
typedef struct node* List;
typedef struct node{
    int address;
    int num;
    int next;
};

List find(int a,List head){
    
    return NULL;
}

void ex(node &a,node &b){
    node temp;
    temp.address=a.address;
    temp.next=a.next;
    temp.num=a.num;
    a.address=b.address;
    a.next=b.next;
    a.num=b.num;
    b.address=temp.address;
    b.next=temp.next;
    b.num=temp.num;
}

List Regular(List LinkedList,int first,int n){
    for(int temp=0;temp<n;temp++){
        //cout<<LinkedList[temp].address<<endl;
        if(LinkedList[temp].address==first){
            ex(LinkedList[0],LinkedList[temp]);
            break;
        }
    }
    int current=0;
    while(current<n){
        if(n<=1){
            break;
        }
        for(int temp=1;temp<n;temp++){
            if(LinkedList[current].next==-1){
                current=n;
                break;
            }
            //cout<<LinkedList[current].next<<" "<<LinkedList[temp].address<<endl; 
            if(LinkedList[current].next==LinkedList[temp].address){                             
                current++;
                if(current!=temp){
                    ex(LinkedList[current],LinkedList[temp]);
                }
            }            
        }
    }
    return LinkedList;
}
List Reverse(List LinkedList,int n,int x){
    int repeat=n/x;
    int times=0;
    for(times=0;times<repeat;times++){
        for(int temp=1;temp<=x;temp++){
            int index=(times+1)*x-temp;
            if(index%x!=0){
                LinkedList[index].next=LinkedList[index-1].address;
            }else{
                if((times+1)*x>=n){
                    LinkedList[index].next=-1;
                }else
                    LinkedList[index].next=LinkedList[(times+1)*x].address;
            }
        }
            cout<<setfill('0') << setw(5)<<LinkedList[index].address;
            cout<<" "<<LinkedList[index].num<<" ";
            if(LinkedList[index].next!=-1){
            cout<<setfill('0')<<setw(5)<<LinkedList[index].next<<endl;
        }else
        {
            cout<<"-1";
        }        
        }
    }
    for(int temp=x*repeat;temp<n;temp++){
        cout<<setfill('0')<<setw(5)<<LinkedList[temp].address;
        cout<<" "<<LinkedList[temp].num<<" ";
        if(LinkedList[temp].next!=-1){
            cout<<setfill('0')<<setw(5)<<LinkedList[temp].next<<endl;
        }else
        {
            cout<<"-1";
        }
        
    }   
}


void Print(List A,int n){
    for(int temp=0;temp<n;temp++){
        cout<<A[temp].address<<" "<<A[temp].num<<" "<<A[temp].next<<endl;
    }
}

int main(void){
    int first_address,n,x;

    cin>>first_address>>n>>x;
    List LinkedList=new node[n];

    for(int temp=0;temp<n;temp++){
        int address,num,next;
        cin>>address>>num>>next;
        LinkedList[temp].address=address;
        LinkedList[temp].num=num;
        LinkedList[temp].next=next;
    }
    
    LinkedList=Regular(LinkedList,first_address,n);

    LinkedList=Reverse(LinkedList,n,x);

    return 0;
}