构造队列

构造队列

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

/**
 * Create by ~JH~ on 2018/4/12
 循环有错或算法复杂度过大。 case通过率为40.00%
 */
public class Main {

    public static void main(String[] args) {
        Scanner sca=new Scanner(System.in);
        int sum=sca.nextInt();
        while(sum-->0){
            LinkedList<Integer> queue=new LinkedList<>();
            int n=sca.nextInt();
            for (int i=1;i<=n;i++){
                queue.add(i);
            }
            LinkedList<Integer>list=new LinkedList<>();
            for (int j=0;j<n;j++){
                int r=queue.get(n-j-1);
                list.add(r);
                if (list.size()==1){
                    continue;
                }
                int tempR=list.get(0);
                list.remove(0);
                list.add(j,tempR);
            }
            for (int i=n-1;i>=1;i--) {
                System.out.print(list.get(i)+" ");
            }
            System.out.println(list.get(0));
        }
    }
}