My Solution:
主要思路就是同时读入两个list,并相加,记录是否需要进位取余的情况,当一个list到最后时,直接读另一个list,同时也要考虑进位情况。
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode start = new ListNode(0);
ListNode last = start;
int value;
boolean iscarry = false;
do{
value = l1.val + l2.val;
if(iscarry){
value = value + 1;
iscarry = false;
}
if(value>=10){
iscarry = true;
value = value % 10;
}
ListNode now = new ListNode(value);
last.next = now;
last = now;
if(l1.next!=null && l2.next!=null){
l1 = l1.next;
l2 = l2.next;
}else{
break;
}
}while(true);
ListNode longlist;
boolean haslong = false;
if(l1.next == null && l2.next == null){
haslong = true;
longlist = l1.next;
}else if(l2.next == null){
longlist = l1.next;
System.out.print(longlist.val);
}else{
longlist = l2.next;
}
while(!haslong){
value = longlist.val;
if(iscarry){
value = value + 1;
iscarry = false;
}
if(value>=10){
value = value % 10;
iscarry = true;
}
ListNode now = new ListNode(value);
last.next = now;
last = now;
if(longlist.next == null){
break;
}
longlist = longlist.next;
}
if(iscarry){
ListNode now = new ListNode(1);
last.next = now;
}
return start.next;
}
}
Reference Solution:
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode dummyHead = new ListNode(0);
ListNode p = l1, q = l2, curr = dummyHead;
int carry = 0;
while (p != null || q != null) {
int x = (p != null) ? p.val : 0;
int y = (q != null) ? q.val : 0;
int sum = carry + x + y;
carry = sum / 10;
curr.next = new ListNode(sum % 10);
curr = curr.next;
if (p != null) p = p.next;
if (q != null) q = q.next;
}
if (carry > 0) {
curr.next = new ListNode(carry);
}
return dummyHead.next;
}
对比结果:
1. 解决思路是一样的,但很多地方却写的很啰嗦。喜欢用if..else解决问题,使代码很冗余。
2.同时遍历直到都为list末尾才结束。
3.进位直接用0或者1表示。 carry = sum/10, sum = carry + x + y 很巧妙
4.先到达list末尾的用0替代
5.dummyHead 注意取名
6.不明白为什么不能直接用l1 l2而要用p q?是因为用了l1 l2后就再也找不到list的头部了吗?
(我真是太辣鸡了,我写这道题写了2小时...遇到了一堆问题...比如开始的时候把输入都写错了也不熟悉leetcode的调试模式...这道题还有长数字没法直接用int存储的问题...