SW练习_ADV_轮盘_链表-优快云博客

本文链接：https://blog.youkuaiyun.com/mush_me/article/details/107722952

本文详细介绍了如何使用链表数据结构来实现一个轮盘模拟器，涵盖了链表的基本操作和轮盘旋转的逻辑。通过实例代码，读者可以深入理解链表在实际问题中的应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

package com.company.exam.adv;
import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.List;
import java.util.StringTokenizer;
public class LunPan {
    public static void main(String[] args) throws Exception{
        BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st=new StringTokenizer(reader.readLine());
        int T=Integer.parseInt(st.nextToken());
        for (int z = 0; z <T ; z++) {
            st=new StringTokenizer(reader.readLine());
            String str1=st.nextToken();
            String str2=st.nextToken();
            if(str1.equals(str2)){
                System.out.printf("#%d %s\n",(z+1),"A0");
                continue;
            }
            if(str1.length()!=32 || str2.length()!=32){
                System.out.printf("#%d %s\n",(z+1),"-1");
                continue;
            }
            int l=lprocess(str1,str2);
            int r=rprocess(str1,str2);
            //System.out.printf("             #%d l:%d d:%d \n",(z+1),l,r);
            if(l==r && l!=-1){
                System.out.printf("#%d A%s\n",(z+1),l);
            }else if(l==-1){
                System.out.printf("#%d %d\n",(z+1),l);
            }else if(l>r){
                System.out.printf("#%d R%s\n",(z+1),r);
            }else{
                System.out.printf("#%d L%s\n",(z+1),l);
            }
        }
        reader.close();
    }
    public static int lprocess(String a,String b){
        LinkedList<String> lista=new LinkedList<>();
        LinkedList<String> listb=new LinkedList<>();
        for (int i = 0; i <a.length() ; i++) {
            lista.add(String.valueOf(a.charAt(i)));
            listb.add(String.valueOf(b.charAt(i)));
        }
        int l=0;
        boolean flag=false;
        for (int i = 1; i <=31 ; i++) {
            lista.add(lista.pop());
            l++;
            if(lista.toString().equals(listb.toString())){
                flag=true;
                break;
            }
        }
        if(!flag){
            return -1;
        }
        return l;
    }

    public static int rprocess(String a,String b){
        LinkedList<String> lista=new LinkedList<>();
        LinkedList<String> listb=new LinkedList<>();
        for (int i = 0; i <a.length() ; i++) {
            lista.add(String.valueOf(a.charAt(i)));
            listb.add(String.valueOf(b.charAt(i)));
        }
        int l=0;
        boolean flag=false;
        for (int i = 1; i <=31 ; i++) {
            String last=lista.getLast();
            lista.removeLast();
            lista.addFirst(last);
            l++;
            if(lista.toString().equals(listb.toString())){
                flag=true;
                break;
            }
        }
        if(!flag){
            return -1;
        }
        return l;
    }
}