Java simple solution |faster than 97%|
class Solution {\n    public List addToArrayForm(int[] num, int k) {\n\t\n        int n = num.length;\n        int i = n-1;\n        List sol = new ArrayList<>(
class Solution {\n    public List<Integer> addToArrayForm(int[] num, int k) {\n\t\n        int n = num.length;\n        int i = n-1;\n        List<Integer> sol = new ArrayList<>();\n        while(i >= 0 || k > 0) { \n            if(i >= 0) {\n            sol.add((num[i] + k) % 10);\n            k = (num[i] + k) / 10;\n        } else { \n            sol.add(k % 10);\n            k = k / 10;\n            }\n            i--;\n        }\n        Collections.reverse(sol);\n        return sol;\n    }\n}
['Java']