Given an ArrayList of Integers, find out if any element of the list has a value with more digits than the element before it. If so, take off the extra rightmost digits and add them as their own integer element at the end of the ArrayList. Keep processing the list from beginning to end until you cannot make any more such changes - in many cases, your algorithm will require more than one pass! By the time your processing is done, all items in the ArrayList will have nonincreasing numbers of digits. Return the modified ArrayList.

EXAMPLE

Suppose the input had three elements, with these values.

[105, 912534490, 32]

After one pass, the ArrayList looks like this:

[105, 912, 32, 534490]

After two passes:

[105, 912, 32, 53, 4490]

After a third and final pass, the output is:

[105, 912, 32, 53, 44, 90]

Note that -5 still only has one digit (it also has a negative sign). Also, you might need to process more items than you originally thought.

HINT

There are a few different ways to figure out how many base-10 digits a number has. For a more interesting challenge, don't use String.