https://leetcode-cn.com/problems/add-two-numbers/
给你两个 非空 的链表,表示两个非负的整数。它们每位数字都是按照 逆序 的方式存储的,并且每个节点只能存储 一位 数字。
请你将两个数相加,并以相同形式返回一个表示和的链表。
你可以假设除了数字 0 之外,这两个数都不会以 0 开头。
示例:
输入:l1 = [2,4,3], l2 = [5,6,4] 输出:[7,0,8] 解释:342 + 465 = 807.
解法:
package leetcode2;
/**
* 2021/3/8 13:33
*
* @Author ayue
*/
public class Solution2 {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode head = null, tail = null;
int carry = 0;
while (l1 != null || l2 != null) {//两个链表同时遍历
int n1 = l1 == null ? 0 : l1.val;
int n2 = l2 == null ? 0 : l2.val;
int num = n1 + n2 + carry;
if (head == null) {
head = tail = new ListNode(num % 10);
} else {
tail.next = new ListNode(num % 10);
tail = tail.next;
}
carry = num / 10;
if (l1 != null) {
l1 = l1.next;
}
if (l2 != null) {
l2 = l2.next;
}
}
if (carry > 0) {
tail.next = new ListNode(carry);
}
return head;
}
class ListNode {
int val;
ListNode next;
ListNode() {
}
ListNode(int val) {
this.val = val;
}
ListNode(int val, ListNode next) {
this.val = val;
this.next = next;
}
}
public static void main(String[] args) {
Solution2 s2 = new Solution2();
ListNode l1 = s2.new ListNode();
l1.val = 2;
l1.next = s2.new ListNode();
l1.next.val = 4;
l1.next.next = s2.new ListNode();
l1.next.next.val = 3;
ListNode l2 = s2.new ListNode();
l2.val = 5;
l2.next = s2.new ListNode();
l2.next.val = 6;
l2.next.next = s2.new ListNode();
l2.next.next.val = 4;
ListNode l = s2.addTwoNumbers(l1, l2);
System.out.println(l.val);
System.out.println(l.next.val);
System.out.println(l.next.next.val);
// System.out.println(l.next.next.next.val);
}
}
暴露的问题:对于链表的遍历,尤其是双链表的同时遍历理解不够。