题目链接:https://leetcode.com/problems/add-two-numbers/
题目:
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
思路:
对齐链表,注意尾结点如果计算有进位要新生成一个结点记录。
算法:
public int getListLength(ListNode head) {
int length = 0;
ListNode p = head;
while (p != null) {
length++;
p = p.next;
}
return length;
}
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
// t指向长链表,长链表存储结果
ListNode s = l2, t = l1, th = l1, tp = null;// s指向短链表,th指向长链表头部,tp尾结点
int d = 0, val = 0;// d存贮进位,val是每位的计算结果
if (getListLength(l1) < getListLength(l2)) {// 对齐链表位数,确定长、短链表头
t = l2;
th = l2;
s = l1;
}
while (t != null) {
int sval = 0;// 短链表结点值
if (s != null) {
sval = s.val;
s = s.next;
} else { // 如果短节点已经计算到尾部,令高位补0
sval = 0;
}
val = t.val + sval + d;
d = val / 10;
val = val % 10;
t.val = val;// 计算结果放入结果链表
tp = t;
t = t.next;
}
if (d == 1) {// 最后一位如果有进位,生成一个新节点
ListNode rear = new ListNode(1);
tp.next = rear;
}
return th;
}