Java实现 洛谷 P1125 [NOIP2008 提高组] 笨小猴

import java.util.ArrayList;
import java.util.Collection;
import java.util.Scanner;

import static java.util.Collections.sort;

public class 苯小猴 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String str = sc.next();
        char[] a = str.toCharArray();//将字符串转化为字符串数组
        int[] count=new int[26];
        int p=0;
        for (int i = 0; i < a.length; i++) {
            p=a[i]-'a';//error  输出语句中显示p= 4 17 17 14 17
            count[p]++;
        }
        ArrayList<Integer> list = new ArrayList<>();
        for (int i = 0; i < 26; i++) {
            if (count[i]!=0){
                list.add(count[i]);
            }

        }
        sort(list);
        int n=list.get(list.size()-1)-list.get(0);
        if(n==2)
        {
            System.out.println("Lucky Word");
            System.out.println(n);
        }
        else if(n==0 || n==1)
        {
            System.out.println("No Answer");
            System.out.println(0);
        }else{
            for (int i = 2; i < n; i++) {
                if (n%i==0){
                    System.out.println("No Answer");
                    System.out.println(0);
                    break;
                }else if(i==n-1){
                    System.out.println("Lucky Word");
                    System.out.println(n);
                }

            }
        }
    }
}