<pre name="code" class="java">package com.one;
//数组中三个只出现一次的数字[算法]
public class Test02 {
public static void main(String args[]) {
int[] num = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 6, 4, 3, 5 };
find(num);
}
public static void find(int[] num) {
if(num==null||num.length==0){
return;
}
int len = num.length;
int[] count = new int[255];
for(int i=0;i<len;i++){
int n = num[i];
count[n]++;
}
int a= 0;//取前三个
for(int i = 0 ; i < len;i++){
int n = num[i];
if(count[n]==1){
a++;
System.out.println(num[i]);
if(a==3){
return;
}
}
}
}
}