internhunt7
BAN USERimport java.util.*;
import java.io.*;
//Time Complexity: O(n)
public class Gap
{
public static void main(String args[])
{
int arr[] = {1,1,2,2,3,3,4,4,5,5,5,6,6,7,7,8,8,8,8,9,9,10,10};
ArrayList<Integer> odd = new ArrayList<Integer>();
for(int n : arr)
{
int result = odd.indexOf(n);
if(result != -1)
{
odd.remove(result);
}
else
{
odd.add(n);
}
}
System.out.println("\nNumber occuring Odd number of times: ");
ListIterator<Integer> listPtr = odd.listIterator();
while(listPtr.hasNext())
{
System.out.println(listPtr.next());
}
}
}
I believe this would not be O(n) since ArrayList would search linearly for every single search. HashMap is a better option.
- internhunt7 April 10, 2014