problem2

README

< Previous 　　　　　　　　　　　　　　　　 Next >

2. Add Two Numbers (Medium)

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example:

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

Related Topics

[Linked List] [Math]

Similar Questions

1. Multiply Strings (Medium)
2. Add Binary (Easy)
3. Sum of Two Integers (Easy)
4. Add Strings (Easy)
5. Add Two Numbers II (Medium)
6. Add to Array-Form of Integer (Easy)

Documentation

Index

• type ListNode

Types

type ListNode

type ListNode = kit.ListNode

ListNode - Definition for singly-linked list.