抛砖引玉,请高手提出更优的算法 int[] a = {
0, 1, 0, 1, 2};
Set set = new HashSet();
for (int i = 0; i < a.length; i++) {
System.out.println(a[i]);
set.add(new Integer(a[i]));
}
int[] b = new int[set.size()];
Iterator it = set.iterator();
int i = 0;
while (it.hasNext()) {
b[i++] = ( (Integer) it.next()).intValue();
}
System.out.println("----------------------");
for (i = 0; i < b.length; i++) {
System.out.println(b[i]);
}
0, 1, 0, 1, 2};
Set set = new HashSet();
for (int i = 0; i < a.length; i++) {
System.out.println(a[i]);
set.add(new Integer(a[i]));
}
int[] b = new int[set.size()];
Iterator it = set.iterator();
int i = 0;
while (it.hasNext()) {
b[i++] = ( (Integer) it.next()).intValue();
}
System.out.println("----------------------");
for (i = 0; i < b.length; i++) {
System.out.println(b[i]);
}
解决方案 »
免费领取超大流量手机卡,每月29元包185G流量+100分钟通话, 中国电信官方发货