2. Add Two Numbers

最新推荐文章于 2024-09-07 18:44:11 发布

zhouyanz

最新推荐文章于 2024-09-07 18:44:11 发布

阅读量257

点赞数

分类专栏： Leetcode 文章标签： LeetCode Java

本文链接：https://blog.csdn.net/zhouyanz/article/details/50952998

版权

Leetcode 专栏收录该内容

196 篇文章 0 订阅

订阅专栏

You are given two linked lists representing two non-negative numbers. 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.

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

Subscribe to see which companies asked this question

一位一位加就行注意有可能两条不一样长

/**
 * 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 l10=new ListNode(0);
        ListNode l20=new ListNode(0);
        ListNode result =new ListNode(0);
    //    ListNode tmp = new ListNode();
        l10=l1;l20=l2;
        result.val=l10.val+l20.val;
      ListNode  tmp=result;
        while(l10.next!=null||l20.next!=null){
           if (l10.next!=null){l10=l10.next;}else {l10.val=0;}
         if (l20.next!=null){l20=l20.next;}else {l20.val=0;}
            if(tmp.val>=10){
                tmp.val-=10;
                ListNode tmp2=new ListNode(l10.val+l20.val+1);
                tmp.next=tmp2;
                tmp=tmp2;
            }else{
                 ListNode tmp2=new ListNode(l10.val+l20.val);
                tmp.next=tmp2;
                tmp=tmp2;
            }
        }if(tmp.val>=10){tmp.val-=10;ListNode tmp3=new ListNode(1);tmp.next=tmp3;}
        return result;
    }
}