/*数组的去重(从前给后,不使用集合)*/
int[] a = {1, 2, 3, 5, 2, 0};
int length = a.length;
int[] middle = new int[length];
int k = 0;
//数组的去重1 --去重元素
for (int i = 0; i < length; i++) {
boolean flag = true;
for (int j = i + 1; j < length; j++) {
if (a[i] == a[j]) {
flag = false;
continue;
}
}
//赋值,去空位置
if (flag) {
middle[k] = a[i];
k++;
}
}
//数组的去重2 --去数组多余的默认值
int[] exclude = new int[k];
for (int w = 0; w < exclude.length; w++){
exclude[w] = middle[w];
}
//打印去重的数组exclude
for (int q = 0; q < exclude.length; q++) {
System.out.print(exclude[q] + ",");
}
结果: