Add Two Numbers
Description
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.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Solutions
1、逐个遍历两个List的元素
2、每一次访问元素就new一个新节点
3、将前驱节点next指向新创建的节点
4、在循环体外创建最终返回的结果result,该指针始终指向链表的第一个节点,另外使用临时tmp用来指向最后一个节点,方便接入新节点
Run Code
Code
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
// 最终返回的结果
ListNode result = null;
// 游标,始终指向最后节点
ListNode tmp = null;
// 存储两个数值相加结果
int sum = 0;
// 每次访问对象的循环体
while (l1 != null && l2 != null) {
if (tmp != null && sum > 9) {
sum = l1.val + l2.val + 1;
} else {
sum = l1.val + l2.val;
}
if (result == null) {
// 第一次时需要将result指向第一个节点
result = tmp = new ListNode(sum % 10);
} else {
// 之后每次访问节点时都创建新对象,游标下移
tmp.next = new ListNode(sum % 10);
tmp = tmp.next;
}
// 输入的链表也下移
l1 = l1.next;
l2 = l2.next;
}
return result;
}
}
// 链表的节点的数据结构
class ListNode {
int val;
ListNode next;
ListNode(int x) {
val = x;
}
}