华为机试题提交失败 在eclipse中结果正确:数据分类处理
提交失败的测试用例在eclipse上也可以通过 题目链接:https://www.nowcoder.com/practice/9a763ed59c7243bd8ab706b2da52b7fd?tpId=37&tqId=21248&tPage=2&rp=&ru=/ta/huawei&qru=/ta/huawei/question-ranking 请大神指教 为什么提交不了
package three;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeSet;
public class treeset_0408 {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc = new Scanner(System.in);
TreeSet<Integer> ts = new TreeSet<Integer>();
ArrayList<Integer> R = new ArrayList<Integer>();
ArrayList<Integer> L = new ArrayList<Integer>();
ArrayList<Integer> A = new ArrayList<Integer>();
Map<Integer, Integer> m = new HashMap<Integer, Integer>();
int sumIj;
//输入L和有序无重复的R
while (sc.hasNext()) {
int k = sc.nextInt();
for (int i = 0; i < k; i++) {
L.add(sc.nextInt());
}
int n = sc.nextInt();
for (int i = 0; i < n; i++) {
ts.add(sc.nextInt());
}
R.addAll(ts);
break;
}
for (int i = 0; i < R.size(); i++) {
int r = R.get(i);
String sr = "" + r;
sumIj = 0;
m.clear();
for (int j = 0; j < L.size(); j++) {
int l = L.get(j);
String sl = "" + l;
if (sl.contains(sr)) {//判断Lj是否包含Ri
sumIj++;
m.put(j, L.get(j));
}
}
if (sumIj > 0) {
A.add(r);
A.add(sumIj);
for (Map.Entry entry : m.entrySet()) {
A.add((Integer) entry.getKey());
A.add((Integer) entry.getValue());
}
}
}
System.out.print(A.size());
for (int i = 0; i < A.size(); i++) {
System.out.print(" " + A.get(i) + "");
}
}
}