62,630
社区成员




import java.util.HashSet;
import java.util.Set;
class FindSame {
public static void main(String args[]) {
System.out.println("This is a simple java program");
int arrayInt[] = {1, 2, 1, 3, 4, 6, 7};
checkSameIntItems(arrayInt);
String arrayStr[] = {"1", "2", "1", "3", "4", "6", "7"};
checkSameStrItems(arrayStr);
}
private static void checkSameIntItems(int[] array) {
Set<Integer> set = new HashSet();
boolean bCheckSame = false;
for (int i=0; i<array.length; i++) {
if (!set.add(array[i])) {
bCheckSame = true;
}
}
System.out.println("The hash items:");
for (Object o : set) {
System.out.println(o);
}
if (bCheckSame) {
System.out.println("The array has same item");
}
else {
System.out.println("The array has not same item");
}
}
private static void checkSameStrItems(String[] array) {
Set<String> set = new HashSet();
boolean bCheckSame = false;
for (int i=0; i<array.length; i++) {
if (!set.add(array[i])) {
bCheckSame = true;
}
}
System.out.println("The hash items:");
for (Object o : set) {
System.out.println(o);
}
if (bCheckSame) {
System.out.println("The array has same item");
}
else {
System.out.println("The array has not same item");
}
}
}
Set<String> set=new TreeSet<String>();
这样存储的元素就不会有重复的了,没有必要写的这么复杂