[Medium]Add Two Numbers

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

Solution

/** * 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 l = new ListNode((l1.val+l2.val)%10);        ListNode L = l;        int addnum = (l1.val+l2.val)/10;        while(true){            if(l1.next!=null&&l2.next!=null){                ListNode n1 = l1.next;                ListNode n2 = l2.next;                l.next = new ListNode((n1.val+n2.val+addnum)%10);                addnum = (n1.val+n2.val+addnum)/10;                l1 = l1.next;                l2 = l2.next;                l = l.next;            }else {                while(l1.next!=null){                    ListNode n1 = l1.next;                    l.next = new ListNode((n1.val+addnum)%10);                    addnum = (n1.val+addnum)/10;                    l1 = l1.next;                    l = l.next;                }                while(l2.next!=null){                    ListNode n2 = l2.next;                    l.next = new ListNode((n2.val+addnum)%10);                    addnum = (n2.val+addnum)/10;                    l2 = l2.next;                    l = l.next;                }                if(addnum!=0)                    l.next = new ListNode(addnum);                break;            }        }        return L;    }}

Analysis

链表遍历