Add Two Numbers
You are given two non-empty linked lists representing two non-negative integers. 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.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.
题目大意及分析
首先是两个链表,分别存贮了两个数,链头表示个位(低位),链尾表示高位。
然后是两个数字相加,和我们平时计算的思维一样,是从低位向高位相加的,从链头开始,依次遍历两个链表(只要其中一个没有遍历完就继续执行,直到两个链表都遍历到尾,p.next = null && q.next = null),若是两个数相加 > 10 则进位。
代码实现
//代码是官方的代码,我的思路也差不多,实现不如人家的好看,就没有贴自己的代码,直接给代码加上注释
/**
* 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 dummyHead = new ListNode(0);//dummyHead保存result的链表头
ListNode p = l1, q = l2, curr = dummyHead;
int carry = 0;
while (p != null || q != null) {
int x = (p != null) ? p.val : 0;//若不为null则取出值计算,为空则补0计算
int y = (q != null) ? q.val : 0;//同上
int sum = carry + x + y;//加上进位计算
carry = sum / 10;//判断是否进位
curr.next = new ListNode(sum % 10);//新建节点保存sum取余后的结果,进位后的
curr = curr.next;//指针后移
if (p != null) p = p.next;//若不到链尾则后移
if (q != null) q = q.next;//同上
}
if (carry > 0) {
curr.next = new ListNode(carry);//最后一位若有进位则保存1,carry == 1
}
return dummyHead.next;//dummyHead保存的是0,从下一个节点开始返回,即为结果。
}
}