2. 两数相加
给你两个 非空 的链表,表示两个非负的整数。它们每位数字都是按照 逆序 的方式存储的,并且每个节点只能存储 一位 数字。
请你将两个数相加,并以相同形式返回一个表示和的链表。
你可以假设除了数字 0 之外,这两个数都不会以 0 开头。
示例 1:
输入:l1 = [2,4,3], l2 = [5,6,4]
输出:[7,0,8]
解释:342 + 465 = 807.
示例 2:
输入:l1 = [0], l2 = [0]
输出:[0]
示例 3:
输入:l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
输出:[8,9,9,9,0,0,0,1]
提示:
- 每个链表中的节点数在范围
[1, 100]
内 0 <= Node.val <= 9
- 题目数据保证列表表示的数字不含前导零
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
boolean flag = false;//true 为 l1,false为l2
ListNode ansl1 = l1;
ListNode ansl2 = l2;
ListNode ansl1Pre = null;
ListNode ansl2Pre = null;
int d= 0;
while(true){
boolean flag1 = false;
boolean flag2 = false;
int a=0,b=0,c=0;
if(ansl1 != null){
a = ansl1.val;
flag1 = true;
}
if(ansl2 != null){
b = ansl2.val;
flag2 = true;
}
if(flag1 &&ansl1.next == null)
ansl1Pre = ansl1;
if(flag2 &&ansl2.next == null)
ansl2Pre = ansl2;
c = (a+b+d)%10;
if(flag1 && flag2){
ansl1.val = c;
ansl2.val = c;
ansl1 = ansl1.next;
ansl2 = ansl2.next;
}
if(flag1 && !flag2){
ansl1.val = c;
ansl1 = ansl1.next;
flag = true;
}
if(!flag1 && flag2){
ansl2.val = c;
ansl2 = ansl2.next;
}
if(!flag1 && !flag2){
if(d==0){
System.out.println(d);
if(flag)
return l1;
else
return l2;
}else{
ListNode l = new ListNode(d);
System.out.println(d);
if(flag){
ansl1Pre.next = l;
return l1;
}else{
ansl2Pre.next = l;
return l2;
}
}
}
d = (a+b+d)/10;
}
}
}
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode head = null;
ListNode tail = null;
int carry = 0;
while(l1 != null || l2 != null){
int a = l1 != null ? l1.val : 0;
int b = l2 != null ? l2.val : 0;
carry = a+b+carry;
if(head==null){
head = tail = new ListNode(carry%10);
}else{
tail.next = new ListNode(carry%10);
tail = tail.next;
}
carry /= 10;
if(l1!=null)
l1 = l1.next;
if(l2!=null)
l2 = l2.next;
}
if(carry>0){
tail.next = new ListNode(carry);
}
return head;
}
}