1074 Reversing Linked List (25分)

最新推荐文章于 2021-03-06 20:05:12 发布

zbchenchanghao

最新推荐文章于 2021-03-06 20:05:12 发布

阅读量96

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/zbchenchanghao/article/details/104289745

版权

PAT 专栏收录该内容

126 篇文章 0 订阅

订阅专栏

Given a constant K and a singly linked list L, you are supposed to reverse the links of every Kelements 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 (≤105) 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

坑点：最后一个测试节点，不要使用提供的n直接计算，会有多余的节点给到，所以，需要遍历一边链表，看看到底有多少个节点为有效节点。

#include<iostream>
#include<vector>
#include<cmath>
#include<algorithm>
using namespace std;

int main(){

    int start, n, k;
    cin >> start >> n >> k;
    int list_data[100001];
    int list[100001];
    for(int i = 0; i < n; i++)
    {
        int a, data, b;
        scanf("%d %d %d", &a, &data, &b);
        list[a] = b;
        list_data[a] = data;
    }
    vector<vector<int> > vec;
    int vec_size = ceill(1.0 * n / k);
    vec.resize(vec_size);
    int flag = -1;
    int cnt = 0;
    for(int i = 0; start != -1; i++){
        if(i % k == 0){

            flag++;
            
        }
        vec[flag].push_back(start);

        start = list[start];
        cnt++;

    }

    bool out_flag = true;
    if(cnt % k == 0){
        out_flag = false;
    }
    for(int i = 0; i < vec_size - 1; i++){
        for(int j = vec[i].size() - 1; j >= 1; j--){

            printf("%05d %d %05d\n", vec[i][j], list_data[vec[i][j]], vec[i][j - 1]);
        }
        if(i == vec_size - 2 && out_flag){
            printf("%05d %d %05d\n", vec[i][0], list_data[vec[i][0]], vec[i + 1][0]);
        }        
        else
        {
            printf("%05d %d %05d\n", vec[i][0], list_data[vec[i][0]], vec[i + 1][vec[i].size() - 1]);
        }
        

    }
    if(out_flag){


        for(int j = 0 ; j < vec[vec_size - 1].size() - 1; j++){

            printf("%05d %d %05d\n", vec[vec_size - 1][j], list_data[vec[vec_size - 1][j]], vec[vec_size - 1][j + 1]);
        }
        printf("%05d %d -1\n", vec[vec_size - 1][vec[vec_size - 1].size() - 1], list_data[vec[vec_size - 1][vec[vec_size - 1].size() - 1]]);

    }else
    {
        for(int j = vec[vec_size - 1].size() - 1; j >= 1; j--){

            printf("%05d %d %05d\n", vec[vec_size - 1][j], list_data[vec[vec_size - 1][j]], vec[vec_size - 1][j - 1]);
        }
        printf("%05d %d -1\n", vec[vec_size - 1][0], list_data[vec[vec_size - 1][0]]);
    }
    
    

    return 0;
}