| 1 | def add(arr1, arr2): |
| 2 | |
| 3 | l = max(len(arr1), len(arr2)) |
| 4 | result = [0 for j in range(l)] |
| 5 | c = 0 |
| 6 | i = len(arr1) - 1 |
| 7 | j = len(arr2) - 1 |
| 8 | r = 0 |
| 9 | l -= 1 |
| 10 | |
| 11 | while i >= 0 and j >= 0: |
| 12 | r = arr1[i] + arr2[j] + c |
| 13 | i -= 1 |
| 14 | j -= 1 |
| 15 | c = r // 10 |
| 16 | result[l] = r % 10 |
| 17 | l -= 1 |
| 18 | |
| 19 | while i >= 0: |
| 20 | r = arr1[i] + c |
| 21 | i -= 1 |
| 22 | c = r // 10 |
| 23 | result[l] = r % 10 |
| 24 | l -= 1 |
| 25 | |
| 26 | while j >= 0: |
| 27 | r = arr1[j] + c |
| 28 | j -= 1 |
| 29 | c = r // 10 |
| 30 | result[l] = r % 10 |
| 31 | l -= 1 |
| 32 | |
| 33 | if c != 0: |
| 34 | new_result = [0 for j in range(len(result) + 1)] |
| 35 | t = len(new_result) - 1 |
| 36 | while t > 0: |
| 37 | new_result[t] = result[t - 1] |
| 38 | t -= 1 |
| 39 | new_result[0] = c |
| 40 | return new_result |
| 41 | return result |
| 42 | |
| 43 | arr1 = [9, 9, 9, 9, 9, 9, 9] |
| 44 | arr2 = [1, 6, 8, 2, 6, 7] |