用数组的方法实现数组去重
package cn.qf.day16.test;
import java.util.Arrays;
/**
* @author CC
* 数组去重
*/
public class Test {
public static void main(String[] args) {
int[] aryNum={0,12,12,34,2,45,3,2,34,5,56,12,55,55,2,0};
int[] newAry=new int[aryNum.length];
System.out.println("原数组:");
System.out.println(Arrays.toString(aryNum));
newAry[0]=aryNum[0];
//外层循环控制从老数组中逐个获取元素
int index=1;
int n = 0;
for(int i=1; i<newAry.length; i++){
//老数组中第二个元素开始判断
//内层循环控制:从新数组的第一个元素开始,到已经存放数组元素的索引的循环的变化
boolean flag=true;
for(int j=0; j<index; j++){
if(aryNum[i]==newAry[j]){
flag=false;
n++;
break;
}
}
if(flag==true ){
newAry[index]=aryNum[i];
index++;
}
}
System.out.println("去重后的数组:");
System.out.println(Arrays.toString(newAry));
//去掉后面多余的0
int[] a = new int[newAry.length-n];
for (int i = 0; i < newAry.length-n; i++) {
a[i] = newAry[i];
}
System.out.println("去重且去除多余0后的数组:");
System.out.println(Arrays.toString(a));
}
}
运行结果: