Let's solve that using recursion...
ArrayList<Integer> al = new ArrayList<>();
void intToArray(int num){
if( num != 0){
int temp = num %10;
num /= 10;
intToArray(num);
al.add(temp);
}
}
Explanation:
Suppose the value of num
is 12345.
During the first call of the function, temp
holds the value 5 and a value of num
= 1234. It is again passed to the function, and now temp
holds the value 4 and the value of num
is 123... This function calls itself till the value of num
is not equal to 0.
Stack trace:
temp - 5 | num - 1234
temp - 4 | num - 123
temp - 3 | num - 12
temp - 2 | num - 1
temp - 1 | num - 0
And then it calls the add method of ArrayList and the value of temp
is added to it, so the value of list is:
ArrayList - 1
ArrayList - 1,2
ArrayList - 1,2,3
ArrayList - 1,2,3,4
ArrayList - 1,2,3,4,5