Skip to main content

Flatten Iterator

Problem: Given an iterator of iterators, can you give me back an iterator which flattens the given iterator. Ex : Suppose you are given an iterator which has these objects - "1", "2", "3", , , then the flattened iterator returned by you should have "1", "2", "3", "4", "5", "6", "7", "8", "9". Iterators may be nested to any level.


This problem can be solved by implementing a FlattenIterator which takes in the given iterator as an agrument in the constructor and delegating the hasNext() and next() calls to the given iterator using a stack. The given iterator is pushed on to the stack. Nested iterators are pushed on to the stack before traversing and once there are no more elements in the iterator, it is popped from the stack. Here is the code -


import java.util.*;

/**
* User: blogkoder
* Date: Jul 28, 2008
* Time: 9:32:39 PM
*/
public class FlattenIterator implements Iterator
{
private final Stack<Iterator<?>> iterators = new Stack<Iterator<?>>();

private boolean hasNextCalled;
private boolean hasNextValue;
private Object next;

/**
* Default constructor which takes in an iterator.
* @param iterator
* @throws RuntimeException - if iterator is null.
*/
public FlattenIterator(Iterator iterator)
{
if (iterator == null)
{
throw new RuntimeException("Iterator cannot be null.");
}

iterators.push(iterator);
}

public boolean hasNext()
{
boolean hasNext = false;

if (hasNextCalled)
{
hasNext = hasNextValue;
}
else
{
iterateNext();

hasNextCalled = true;

hasNext = (next != null);

hasNextValue = hasNext;
}

return hasNext;
}

private void iterateNext()
{
if (!iterators.empty())
{
if (iterators.peek().hasNext())
{
next = iterators.peek().next();

if (next instanceof Iterator)
{
iterators.push((Iterator) next);

iterateNext();
}
}
else
{
iterators.pop();

iterateNext();
}
}
else
{
next = null;
}
}

public Object next()
{
Object returnValue = null;

if (hasNextCalled)
{
hasNextCalled = false;
returnValue = next;
}
else
{
iterateNext();

returnValue = next;
}

if (returnValue == null)
{
throw new NoSuchElementException();
}

return returnValue;
}

public void remove()
{

}
}

Comments

Popular posts from this blog

Even Integer Iterator

Problem : Given an iterator of integers, can you give me back another iterator which iterates over the given iterator of integers such that the new iterator gives only even integers. There a couple of different ways to solve this problem. * The first option is to create a new list of integers and add only the even integers from the given iterator and then return an iterator by calling list.iterator(). This has a time complexity of O (n) but also has a space complexity of O (n) in the worst case, which is not desirable. Here is the code for it - public static Iterator<Integer> giveEvenIntegersIterator(Iterator<Integer> iterator) { List<Integer> evenIntegers = new ArrayList<Integer>(); if (iterator != null) { while(iterator.hasNext()) { Integer number = iterator.next(); if (number != null && number % 2 == 0) { evenIntegers.add(number); } } } retu

Sum of Subsets - Find how many pairs in the given array sum to a given number

Problem : Given an array of integers intArray[] and another integer sum, find how many pairs of numbers in the given array will sum up to the given sum. This problem is one of the most sought after question in interviews. There may be slight variations of this problem. There are many ways to solve this problem. The most efficient solution considering both time and space complexity is the one discussed below - /** * This will find how many pairs of numbers in the given array sum * up to the given number. * * @param array - array of integers * @param sum - The sum * @return int - number of pairs. */ public static int sumOfSubset(int[] array, int sum) {          // This has a complexity of O ( n lg n )         Arrays.sort(array);         int pairCount = 0;         int leftIndex = 0;         int rightIndex = array.length - 1;          // The portion below has a complextiy of         //  O ( n ) in the worst case.         while (array[rightIndex] >= su

Minimum Maximum Stack

Problem : Design a stack of Numbers which will give you the minimum and maximum of all the elements it contains. This problem is also known as MinStack or MaxStack problem which expects you to find only the minimum or maximum. It is restated here to capture both. A stack typically has push(), pop() and size() operations. In order to find the minimum and the maximum, we will need to iterate over the elements of the stack each time we want to find the minimum and maximum. This will result in O (n) time complexity. And typically stack does not let us iterate over the elements. Many do not know that the java.util.Stack implementation does allow it as it extends java.util.Vector. We can make it more efficient by storing the minimum and maximum as instance variables in our stack and update them when ever we push a new number on to the stack. This will result in O(1) complexity for updating the max and min when pushing new numbers on stack, but when we pop the number which is currently set a