Simple Java Solution | Faster than 99.61% | 2ms
\nclass Solution {\n    public List<Integer> addToArrayForm(int[] num, int k) {\n        \n        LinkedList<Integer> result = new LinkedList();\n        \n   
```\nclass Solution {\n    public List<Integer> addToArrayForm(int[] num, int k) {\n        \n        LinkedList<Integer> result = new LinkedList();\n        \n        int sum = 0;\n        int carry = 0;\n        int i = num.length - 1;\n        int data = 0;\n        \n        while(i >= 0 && k > 0){\n            sum = num[i] + (k % 10) + carry;\n            carry = sum / 10;\n            result.addFirst(sum % 10);\n            i--;\n            k = k/10;\n        }\n        while(k > 0){\n            sum = (k % 10) + carry;\n            carry = sum / 10;\n            result.addFirst(sum % 10);\n            k = k/10;\n        }\n        while(i >= 0){\n            sum = num[i] + carry;\n            carry = sum / 10;\n            result.addFirst(sum % 10);\n            i--;\n        }\n        if(carry > 0)\n            result.addFirst(carry);\n        \n        return result;\n      \n    }\n}\n```
['Java']