23,406
社区成员




public static void main(String[] args) {
// String i = "0";
// Fun(i);
// System.out.println(i);
//
// System.out.println("4b9f940b38e8442d9b7cbbc455873b90".matches("\\d*"));
ArrayList<Integer> alList = new ArrayList<Integer>();
int [] is = {1,3,4,2,5,8,0};
for (int j = 0; j < is.length; j++) {
if (!alList.contains(is[j])) {
alList.add(is[j]);
}
for (int k = 0; k < is.length; k++) {
if (j <= k) {
// System.out.println(is[j] + "*" + is[k] + "=" + (is[j] * is[k]));
if (!alList.contains(is[j] * is[k])) {
alList.add(is[j] * is[k]);
}
}
}
}
//排序alLIst
Object [] obj = alList.toArray();
Arrays.sort(obj);
for (int i = 0; i < obj.length; i++) {
System.out.print(obj[i] + "\t");
}
}
有负数的换种排序方式就行了。 没负数这个排序方式代码最简单