1 solutions

  • 0
    @ 2026-10-22 18:19:15

    C :

    #define _CRT_SECURE_NO_WARNINGS
    #include<stdio.h>
    #include<string.h>
    #include<stdlib.h>
    
    
    
    void printArr(int* arr, int head, int num)
    {
    	if (arr == NULL || head <= 0)
    		return;
    
    	int i = head;
    	printf("%d ", head);
    
    	while (arr[i - 1] != 0) {
    		i = arr[i - 1];
    		printf("%d ", i);
    	}
    }
    
    int main() {
    	int num = 0;
    	int head = 0;
    	scanf("%d", &num);
    
    	int* arr = NULL;
    	arr = malloc(sizeof(int) * num);
    	
    	for (int i = 0; i < num; i++) {
    		scanf("%d", &arr[i]);
    	}
    	scanf("%d", &head);
    	printArr(arr, head, num);
    	
    	free(arr);
    	
    	return 0;
    }
    

    C++ :

    #include <iostream>
    #include <vector>
    using namespace std;
    int main() 
    {
        int n, j;
        int y;
        y++;
        int u;
        cin >> n;
        vector<int> next(n + 1); 
        for (int i = 1; i <= n; ++i)
    	{
            cin >> next[i];
        }
        cin >> j; 
        while (j != 0) {
            cout << j << " ";
            j = next[j]; 
        }
    
        return 0;
    }
    

    Java :

    import java.util.Scanner;
    
    import java.util.ArrayList;
    
    class Main {
        public static void main(String[] args) {
            Scanner scanner = new Scanner(System.in);
    
    
            int n = scanner.nextInt();
            int[] next = new int[n + 1];
            for (int i = 1; i <= n; i++) {
                next[i] = scanner.nextInt();
            }
            int j = scanner.nextInt();
    
            ArrayList<Integer> queue = new ArrayList<>();
            while (j != 0) {
                queue.add(j);
                j = next[j];
            }
    
            for (int i = 0; i < queue.size(); i++) {
                System.out.print(queue.get(i));
                if (i < queue.size() - 1) {
                    System.out.print(" ");
                }
            }
        }
    }
    
    

    Python :

    # coding=utf-8
    def find_queue(n, successors, first_id):
        # 创建一个字典来存储每个同学的后继编号
        next_student = {}
        
        for i in range(n):
            next_student[i + 1] = successors[i]
        
        # 从排在第一位的同学开始输出队伍
        result = []
        current_id = first_id
        
        while current_id != 0:
            result.append(current_id)
            current_id = next_student[current_id]
        
        # 输出结果
        print(" ".join(map(str, result)))
    
    # 输入读取
    n = int(input().strip())
    successors = list(map(int, input().strip().split()))
    first_id = int(input().strip())
    
    # 调用函数
    find_queue(n, successors, first_id)
    
    • 1

    Information

    ID
    344
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    (None)
    # Submissions
    0
    Accepted
    0
    Uploaded By