LeetCode2.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.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

思路

直接对所有结点按位相加就可以了。

由于题目说是倒序排列的list，所以从左边开始两两相加即表示从个位对齐，开始加，加到指针为空时停止；另外设置一个int型s，表示进位，在最后若进位为1，则新建一个结点存储1表示为尾节点。

代码

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode result = l1;
        ListNode p = l1;
        ListNode q = l2;
        ListNode r = l1;
        int s = 0;//s表示进位
        int t = 0;
        while(p != null && q != null){
            t = p.val + q.val + s;
            p.val = t % 10;
            s = t / 10;
            r = p;
            p = p.next;
            q = q.next;
        }
        if(p != null){
            while(p != null){
                t = p.val + s;
                p.val = t % 10;
                s = t / 10;
                r = p;
                p = p.next;
            }
        }
        else if(q != null){
            r.next = q;
            r = r.next;
             while(q != null){
                t = q.val + s;
                q.val = t % 10;
                s = t / 10;
                r = q;
                q = q.next;
            }
        }

        if(s == 1){
            ListNode add = new ListNode(1);
            add.next = null;
            r.next = add;
        }
        return result;
    }
}