Java straight froward easy solution ||easy Approach
Intuition\nEasy Java Solution \n\n# Approach\njust like orthodox addition method ie..\n 1 2 \n+  5\n____\n 1 7\n\nhere we are adding numbers from end of array a
# Intuition\nEasy Java Solution \n\n# Approach\njust like orthodox addition method ie..\n 1 2 \n+  5\n____\n 1 7\n\nhere we are adding numbers from end of array a keeping an carry for further addition purpose \n# Complexity\n- Time complexity:\nO(n)\n\n- Space complexity:\nO(n) , for answer set List for solution we do not require any space ie. O(1)\n\n# Code\n```\nclass Solution {\n    public List<Integer> addToArrayForm(int[] num, int k) {\n        List<Integer> list = new ArrayList<>();\n        int carry =0;\n        for(int i =num.length-1;i>=0;i--){\n            int n = k%10;\n            k = k/10;\n            int total = n+num[i]+carry;\n            if(total>9){\n                carry = 1;\n                total = total%10;\n            }\n            else if(total<=9){\n                carry=0;\n            }\n            list.add(0,total);\n        }\n        if(k>0){\n            while(k>0){\n            int n = k%10;\n            k = k/10;\n            int total = n+carry;\n            if(total>9){\n                carry = 1;\n                total = total%10;\n            }\n            else if(total<=9){\n                carry=0;\n            }\n            list.add(0,total);\n            }\n        }\n        if(carry==1){\n            list.add(0,1);\n        }\n        return list;\n    }\n}\n```
['Java']