You are given two non-empty arrays representing two non-negative integers. The digits are stored in **reverse order**, and each element contains a single digit.
Add the two numbers and return the sum as an array, also in **reverse order**.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Example 1
Input:l1 = [2,4,3], l2 = [5,6,4]
Output:[7,0,8]
Explanation:342 + 465 = 807, reversed is [7,0,8].
Example 2
Input:l1 = [0], l2 = [0]
Output:[0]
Example 3
Input:l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
Output:[8,9,9,9,0,0,0,1]
Explanation:9999999 + 9999 = 10009998, reversed is [8,9,9,9,0,0,0,1].
Constraints
- 1 <= l1.length, l2.length <= 100
- 0 <= l1[i], l2[i] <= 9
- The numbers represented by the arrays do not have leading zeroes (except the number 0).