2.Add Two Numbers

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/xhjj520/article/details/80322727

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.
/**
 * 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 res=l1;
        ListNode r=res;
        int add=0;
        while(l1!=null||l2!=null)
        {  
            int value=0;
            int x=(l1==null)?0:l1.val;
            int y=(l2==null)?0:l2.val;
            value=x+y+add;
            add=value/10;
            ListNode ptemp=new ListNode(value%10);          
            if(l1!=null)
               l1=l1.next;
            if(l2!=null)
               l2=l2.next;
            res.next=ptemp;
            res=res.next;
        }
        if(add==1)
        {
             ListNode ptemp=new ListNode(1);
             res.next=ptemp;
        }
        
        return r.next;
    }
}


阅读更多 登录后自动展开
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页