题解 | #查找兄弟单词#
查找兄弟单词
https://www.nowcoder.com/practice/03ba8aeeef73400ca7a37a5f3370fe68
public static void main(String[] args) throws IOException {
BufferedReader bf=new BufferedReader(new InputStreamReader(System.in));
String s=null;
while((s=bf.readLine())!=null){
List<String> list = new ArrayList<>();
//获取输入
String [] input = s.split(" ");
String str2 = input[input.length-2];
int n = Integer.parseInt(input[0]);
int k = Integer.parseInt(input[input.length-1]);
for (int i= 1;i<=n;i++){
if(isBrother(input[i],str2)){
list.add(input[i]);
}
}
int size = list.size();
System.out.println(size);
if (size>=k){
Collections.sort(list);
System.out.println(list.get(k-1));
}
}
}
public static boolean isBrother(String str1,String str2){
if (str1.length()!=str2.length()||str2.equals(str1)){
return false;
}
char[] char1 = str1.toCharArray();
char[] char2 = str2.toCharArray();
Arrays.sort(char1);
Arrays.sort(char2);
return new String(char1).equals(new String(char2));
}
