【Leetcode】2. Add Two Numbers

标签：计算   strong   方式   return   its   mon   elf   lis   ati   

Problem：

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

public ListNode addTwoNumbers(ListNode l1,ListNode l2){
    int carry =0;//每一位的数值
    ListNode p,result = new ListNode(0);
    p=result;
    while(l1!=null||l2!=null||carry!=0){
        if(l1!=null){
            carry+=l1.val;
            l1=l1.next;
        }
        if (l2!=null){
           carry+=l2.val;
           l2=l2.next;
        }
        p.next=new ListNode(carry%10);
        carry/10;
        p=p.next;
    }
    return result.next;
}

【Leetcode】2. Add Two Numbers

标签：计算   strong   方式   return   its   mon   elf   lis   ati   

原文地址：http://www.cnblogs.com/yumiaomiao/p/7029202.html