Well, if the wonderful
Java
libraries don't provide a direct solution, then, you know, you might resort to use development techniques, like iterations, conditional statements and the like...
Set <Integer> s0 = m.get(0).keySet();
Set <Integer> s1 = m.get(1).keySet();
Iterator <Integer> it0 = s0.iterator();
Iterator <Integer> it1 = s1.iterator();
Integer n0 = null;
Integer n1 = null;
Map <Integer, Integer> rm = new HashMap<Integer, Integer>();
int count = 1;
while (true)
{
if ( n0 == null && it0.hasNext() )
n0 = m.get(0).get(it0.next());
if ( n1 == null && it1.hasNext() )
n1 = m.get(1).get(it1.next());
if ( n0 == null )
{
if (n1 == null)
break;
else
{
rm.put(count, n1);
n1 = null;
++count;
}
}
else
{
if (n1 == null)
{
rm.put(count, n0);
n0 = null;
++count;
}
else
{
if ( n0 < n1 )
{
rm.put(count, n0);
n0 = null;
++count;
}
else
{
rm.put(count, n1);
n1 = null;
++count;
}
}
}