力扣第二题 : 给你两个非空的链表,表示两个非负的整数。它们每位数字都是按照 逆序 的方式存储的,并且每个节点只能存储 一位数字。
请你将两个数相加,并以相同形式返回一个表示和的链表。你可以假设除了数字 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:迭代法
step1 :将l1和l2依次相加,将个位数拿出来存储,十位数则向后进1(最大为9+9+1 < 20),即+1,这里设置一个变量next来表示是否+1,
即每一次相加之和为l1.val + l2.val + next
step2 :若l1遍历完了,那么接下来使用l2.val + next,同理对于l2亦然
step3 :若所有数据遍历完了,还要判断最后一次运算结果的十位是否为1,即next是否等于1,next=1,则还需要创建一个节点来存储
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 class mid_两数相加 {
public static ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode res = new ListNode();
ListNode cur = res;
int sum = 0;
int next1 = 0;
while(l1 != null && l2 != null){
sum = l1.val + l2.val + next1;
cur.next = new ListNode(sum % 10); // 存储相加后结果的个位数
next1 = sum / 10 ; // 是否向后进1
cur = cur.next;
l1 = l1.next;
l2 = l2.next;
}
// l2 遍历完只剩l1时
while (l1 != null){
sum = l1.val + next1;
cur.next = new ListNode(sum % 10);
next1 = sum / 10;
cur = cur.next;
l1 = l1.next;
}
// l1 遍历完只剩l2时
while (l2 != null){
sum = l2.val + next1;
cur.next = new ListNode(sum % 10);
next1 = sum / 10;
cur = cur.next;
l2 = l2.next;
}
// l1和l2都遍历完时十位仍然有可能为1
if (next1 != 0 ){
cur.next = new ListNode(1);
}
// 返回res.next是因为res是我们创建的,其第一个节点的值为0
return res.next;
}
public static void main(String[] args) {
ListNode l1_first = new ListNode(2);
ListNode l1_second = new ListNode(4);
ListNode l1_thrid = new ListNode(3);
l1_first.next = l1_second;
l1_second.next = l1_thrid;
ListNode l2_first = new ListNode(5);
ListNode l2_second = new ListNode(6);
ListNode l2_thrid = new ListNode(4);
l2_first.next = l2_second;
l2_second.next = l2_thrid;
ListNode res = addTwoNumbers(l1_first,l2_first);
ListNode cur = res;
do {
System.out.println(cur.val);
cur = cur.next;
}while (cur != null);
}
}
方法2 : 递归法
public static ListNode addTwoNumbersM2(ListNode l1, ListNode l2){
int sum = l1.val + l2.val;
ListNode res = new ListNode(sum % 10);
int next1 = sum / 10;
if(l1.next != null || l2.next != null || next1 != 0){
if (l1.next != null) l1 = l1.next;
else l1 = new ListNode(0);
if (l2.next != null) l2 = l2.next;
else l2 = new ListNode(0);
l1.val = l1.val + next1;
res.next = addTwoNumbersM2(l1, l2);
}
return res;
}