public static void main(String[] args) {
getDistinct(new int[] { 6, 7, 3, 6, 5, 2, 7, 8 });
}
static void getDistinct(int array[]) {
java.util.List list = new java.util.ArrayList();
for (int i = 0; i < array.length; i++) {
if (!list.contains(array[i])) {
list.add(array[i]);
System.out.print(array[i] + " ");
}
}
}
输出:6 7 3 5 2 8
看了一下ArrayList的contains()方法源码:
public boolean contains(Object elem) {
return indexOf(elem) >= 0;
}
public int indexOf(Object elem) {
if (elem == null) {
for (int i = 0; i < size; i++)
if (elementData[i]==null)
return i;
} else {
for (int i = 0; i < size; i++)
if (elem.equals(elementData[i]))
return i;
}
return -1;
}
其实还是嵌套循环,效率不高。先记下,后面仔细想想。