Easy c solution✔✔✔
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\n/**\n * Note: The returned array must be malloced, assume caller calls free().\n */\nint* separateDigits(int* nums, int numsSize, int* returnSize){\n    int size=0;\n    for(int i=0;i<numsSize;i++)\n    {\n        int n=nums[i];\n        while(n!=0)\n        {\n            size++;\n            n/=10;\n        }\n    }\n    int *res = malloc(size*sizeof(int));\n    int k=size-1;\n    for(int i=numsSize-1;i>=0;i--)\n    {\n        int n=nums[i];\n        while(n!=0)\n        {\n            res[k--]=n%10;\n            n/=10;\n        }\n    }\n    *returnSize = size;\n    return res;\n}\n```
['C']