本文共 1062 字，大约阅读时间需要 3 分钟。

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

class Solution {	    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {	        ListNode head = new ListNode(0);	        ListNode p = head;	        int flag = 0;	        int temp = 0;	        while((l1!=null)||(l2!=null)||(flag==1)){	            ListNode newnode =new ListNode(0);	            temp = flag+((l1!=null)?l1.val:0)+((l2!=null)?l2.val:0);	            l1 = (l1!=null)?l1.next:l1;	            l2 = (l2!=null)?l2.next:l2;	            newnode.val = temp%10;	            flag = temp/10;	            p.next = newnode;	            p = newnode;	        } 	        return head.next;	    }}

转载地址：http://xdfni.baihongyu.com/