JAVA SOLUTION || Easy peasy lemon squeezy😊 || SIMPLE
\n\n# Code\n\nclass Solution {\n    public List<Integer> addToArrayForm(int[] num, int k) {\n        List<Integer> list = new ArrayList<>();\n        int i = nu
\n\n# Code\n```\nclass Solution {\n    public List<Integer> addToArrayForm(int[] num, int k) {\n        List<Integer> list = new ArrayList<>();\n        int i = num.length-1;\n        int carry = 0;\n        while(i >= 0){\n            int val = num[i] + (k % 10) + carry;\n            if(val > 9){\n                list.add ( val % 10);\n                val = val/10;\n                carry = val;\n            }\n            else{\n                list.add(  val);\n                carry = 0;\n            }\n            i--;\n            k=k/10;\n        }\n\n        if(i >=0 ){\n            while(i >= 0){\n                list.add(num[i]);\n                 i--;\n            }\n        }\n        if(k != 0){\n            while(k>0){\n            int val = (k % 10) + carry;\n            if(val > 9){\n                list.add ( val % 10);\n                val = val/10;\n                carry = val;\n            }\n            else{\n                list.add(  val);\n                carry = 0;\n            }\n            k = k/10;\n          }\n        }\n        if(carry !=0 ) list.add(carry);\n        Collections.reverse(list);\n        return list;\n    }\n}\n```
['Java']