蓝桥杯算法提高VIP-笨小猴-题解（Java代码）

解题思路:

注意事项:

参考代码:

import java.util.LinkedHashMap;

import java.util.Map;

import java.util.Scanner;

public class Main {

public static void main(String[] args) {

Scanner scanner=new Scanner(System.in);

int i = 0;

String str;

Map<String, Integer> map = new LinkedHashMap<String, Integer>();

while(scanner.hasNext()) {

str=scanner.next();

String[] a=str.split("");

for(i=0;i<a.length;i++) {

//System.out.println(a[i]);

  if(map.get(a[i])==null) 

  map.put(a[i],1); 

  else

  map.put(a[i], map.get(a[i])+1);

}

int maxn=map.get(a[0]);

int minn=map.get(a[0]);

for(String key:map.keySet()) {

maxn=Math.max(maxn, map.get(key));

minn=Math.min(minn, map.get(key));

}

int m=maxn-minn;

int t=0;

if(m<=1) {

    m=0;

System.out.println("No Answer");

}

else {

for(i=2;i*i<=m;i++) {

if(m%i==0) {

t=1;

System.out.println("No Answer");

m=0;

break;

}

}

if(t==0)

System.out.println("Lucky Word");}

System.out.println(m);

}

}

}