You are given two numbers represented as integer arrays A and B, where each digit is an element.
You have to return an array which representing the sum of the two given numbers.
The last element denotes the least significant bit, and the first element denotes the most significant bit.
A = [1, 2, 3] B = [2, 5, 5]
A = [9, 9, 1] B = [1, 2, 1]
[3, 7, 8]
[1, 1, 1, 2]
Simply, add all the digits in their place.
991 + 121 = 1112 Note that the resultant array size might be larger.
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.