自己的代码,混乱之处在于不知道循环怎么处理,而且条件判断的地方过于混乱,导致大量冗余代码。
还有对于逻辑一开始的分析也不够全面,虽然不用自己写测试用例,但是这也应该在自己的考虑范围之内。
public class Test {
public static class ListNode {
int val;
ListNode next;
ListNode(int x) {
val = x;
}
@Override
public String toString() {
StringBuilder s = new StringBuilder();
s.append(val);
ListNode temp = this.next;
while (temp != null) {
s.append(" -> ");
s.append(temp.val);
temp = temp.next;
}
return s.toString();
}
}
public static ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode res = null, temp;
int carry = 0;
temp = new ListNode(-1);
if (l1 == null) {
l2.val += carry;
temp.next = l2;
} else if (l2 == null) {
l1.val += carry;
temp.next = l1;
} else {
int val = l1.val + l2.val;
int val1 = val + carry;
temp.val = val1 % 10;
carry = val1 / 10;
l1 = l1.next;
l2 = l2.next;
res = temp;
}
while (null != l1 || null != l2 || carry != 0) {
if (l1 == null && l2 != null) {
temp.next = new ListNode(-1);
temp = temp.next;
int val = l2.val;
int val1 = val + carry;
temp.val = val1 % 10;
carry = val1 / 10;
l2 = l2.next;
} else if (l2 == null && l1 != null) {
temp.next = new ListNode(-1);
temp = temp.next;
int val = l1.val;
int val1 = val + carry;
temp.val = val1 % 10;
carry = val1 / 10;
l1 = l1.next;
} else if (l2 != null && l1 != null) {
temp.next = new ListNode(-1);
temp = temp.next;
int val = l1.val + l2.val;
int val1 = val + carry;
temp.val = val1 % 10;
carry = val1 / 10;
l1 = l1.next;
l2 = l2.next;
} else {
temp.next = new ListNode(1);
break;
}
}
return res;
}
public static void main(String[] args) {
ListNode l1 = new ListNode(9);
l1.next = new ListNode(9);
l1.next.next = new ListNode(3);
ListNode l2 = new ListNode(1);
// l2.next = new ListNode(6);
// l2.next.next = new ListNode(4);
ListNode result = addTwoNumbers(l1, l2);
System.out.println(result);
}
}
官方的代码
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;
}