题解 | #查找兄弟单词#
查找兄弟单词
https://www.nowcoder.com/practice/03ba8aeeef73400ca7a37a5f3370fe68
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String input = in.nextLine();
String[] datas = input.split(" ");
String compareStr = datas[datas.length - 2];
int index = Integer.valueOf(datas[datas.length - 1]);
List dataList = new ArrayList();
for (int i = 1; i < datas.length - 2 ; i++ ) {
if (datas[i].equals(compareStr)) {
continue;
}
if (datas[i].length() == compareStr.length()) {
boolean flag = true;
for ( int j = 0; j < compareStr.length(); j++) {
String compStr = compareStr.substring(j, j + 1);
int countComp = 0;
int countData = 0;
for (int k = 0; k < datas[i].length(); k++) {
if (datas[i].substring(k, k + 1).equals(compStr)) {
countData++;
}
if (compareStr.substring(k, k + 1).equals(compStr)) {
countComp++;
}
}
if (countComp != countData) {
flag = false;
break;
}
}
if (flag) {
dataList.add(datas[i]);
}
}
}
System.out.println(dataList.size());
if (dataList.size() > 0 && index < dataList.size()+1) {
System.out.println(dataList.stream().sorted().skip(index-1).findFirst().get());
}
}
}
阿里云工作强度 727人发布