JAVA very easy Solution less than 90.59% memory O(n) time
Please Upvote if you find this helpful\n\nclass Solution {\n    public List<Integer> addToArrayForm(int[] num, int k) {\n        List<Integer> list = new ArrayL
***Please Upvote if you find this helpful***\n```\nclass Solution {\n    public List<Integer> addToArrayForm(int[] num, int k) {\n        List<Integer> list = new ArrayList<>();\n        int sum = 0;\n        for (int i = num.length; i > 0; i--) {\n            if (k > 0) {\n                sum = sum + (k % 10) + num[i-1];\n                list.add(0, sum % 10);\n                k /= 10;\n            }\n            else {\n                sum += num[i-1];\n                list.add(0, sum % 10);\n            }\n            sum /= 10;\n        }\n        while (sum > 0 || k > 0) {\n            sum += k % 10;\n            list.add(0, sum % 10);\n            sum /= 10; k /= 10;\n        }\n        return list;\n    }\n}\n```\n***Please Upvote if you find this helpful***\n![image](https://assets.leetcode.com/users/images/b6d2df43-956f-413b-93d4-eb01a511ceb7_1648970779.6249008.png)\n
[]