Finding the Duplicate element

Why do you use an array?

Instead use the collections java provides.

// I didn't use Autoboxing to make things clear

ArrayList<Integer> integerList = new ArrayList<Integer>();

// add 100 elements here

Integer int_element;

for (int i = 1; i<=100; i++) {

int_element = new Integer(i);

integerList.add( int_element );

}

// f.e. test if 55 is in the array

Integer testInt = new Integer(55);

if integerList.contains( testInt ) {

// found

}

else {

// not found

}

The method contains of ArrayList checks via method equals of the class Integer, if there is an appropiate element.

Internally (if you dare a look into the java source) this should be something like:

class ArrayList() {

public boolean contains(Object o) {

Iterator<Integer> it = this.iterator();

while ( it.hasNext() ) {

if (o.equals( it.next() ) ) {

return true;

}

}

return false;

}

}

Remark for correctness: the contains method of ArrayList uses indexOf(Object o), but indexOf does something similar to the above!

DoodleTheNoodlea at 2007-7-14 21:54:25 >