leetcode每日一题之两数相加
题目链接:
https://leetcode-cn.com/problems/add-two-numbers/
题目描述:
给你两个 非空 的链表,表示两个非负的整数。它们每位数字都是按照 逆序 的方式存储的,并且每个节点只能存储 一位 数字。
请你将两个数相加,并以相同形式返回一个表示和的链表。
你可以假设除了数字 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]
题解:
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
int next1 = 0;//是否进1
int total = 0;//相加得到的和是多少
ListNode dummy = new ListNode();
ListNode cur = dummy;
while (l1 != null && l2 != null) {//计算两个链表相同的部分
total = l1.val + l2.val + next1;
cur.next = new ListNode(total % 10);//得到两数相加之后的个位
next1 = total / 10;//得到两个数相加之后的十位
l1 = l1.next;
l2 = l2.next;
cur = cur.next;
}
while (l1 != null) {//计算l1比l2长的部分
total = l1.val + next1;
cur.next = new ListNode(total % 10);
next1 = total / 10;
l1 = l1.next;
cur = cur.next;
}
while (l2 != null) {//如果l2较长,计算l2比l1长的部分
total = l2.val + next1;
cur.next = new ListNode(total % 10);
next1 = total / 10;
l2 = l2.next;
cur = cur.next;
}
//下面这个步骤千万不要忘记
if (next1 != 0) {//如果最后一位数相加还有进位,需要把进位考虑进去
cur.next = new ListNode(next1);
}
return dummy;
}
解法2:该死的递归
//递归
public ListNode addTwoNumbers2(ListNode l1, ListNode l2) {
int total = l1.val + l2.val;
int next1 = total / 10;
ListNode res = new ListNode(total % 10);
if (l1.next != null || l2.next != null || next1 != 0) {
l1 = l1.next != null ? l1.next : new ListNode(0);
l2 = l2.next != null ? l2.next : new ListNode(0);
l1.val += next1;
res.next = addTwoNumbers2(l1, l2);
}
return res;
}
至于递归可以参考讲解:https://www.bilibili.com/video/BV1Ar4y1N7x1?from=search&seid=5133590194434934250,和反转链表递归详解:https://mp.weixin.qq.com/s/8XsTVNIx3Zl8NfoHnWgI7A
解法3:设置标记位(自己的想法,但是由于太菜,没能实现出来,下面代码是摘抄leetcode)
public ListNode addTwoNumbers3(ListNode l1, ListNode l2) {
ListNode result = new ListNode();
ListNode prev = result;
Boolean flag = false;
while (l1 != null || l2 != null) {
int sum = 0;
if (l1 != null) {
sum += l1.val;
l1 = l1.next;
}
if (l2 != null) {
sum += l2.val;
l2 = l2.next;
}
if (flag) {
sum += 1;
flag = false;
}
if (sum >= 10) {
sum = sum % 10;
flag = true;
}
prev.next = new ListNode(sum);
prev = prev.next;
}
if (flag) {
prev.next = new ListNode(1);
}
return result.next;
}