33,010
社区成员
发帖
与我相关
我的任务
分享
import java.util.HashSet;
public class FindTheDup {
public static void main (String args []) {
Integer [] in = {1,2,3,4,5,6,4,3,2,3,8,9,8,7,5,5,4};
HashSet<Integer> hs = new HashSet<Integer>();
for (int i = in.length-1; i >= 0; i--){
if (!hs.contains(in[i])) {
hs.add(in[i]);
}else {
//打印重复的数字
System.out.println(in[i]);
}
}
}
}
int main(){
int k[9] = {1,2,3,4,5,3,17,18,19};
int hash[20] = {0};
int i = 0;
for(; i<9; ++i)
++hash[k[i]];
for(i=0; i<20; ++i){
if(hash[i] > 1)
printf("%d ",i);
}
return 0;
}