LeetCode_2----Add Two Numbers

最新推荐文章于 2024-09-14 18:46:05 发布

lk1009115563

最新推荐文章于 2024-09-14 18:46:05 发布

阅读量161

点赞数

分类专栏： LeetCode 文章标签： leetCode java

本文链接：https://blog.csdn.net/lk1009115563/article/details/77511916

版权

LeetCode 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

题目：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 ListNode {
     int val;
      ListNode next;
     ListNode(int x) { val = x; }
 }

class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        int flag = 0;
    	ListNode head = new ListNode(0);    //尾插法建立链表，可以弄个头指针，最后返回head.next
    	ListNode node = null;
    	ListNode pre = head;
    	while(l1!=null || l2!=null) {
    		int v1 = l1!=null ? l1.val : 0;
    		int v2 = l2!=null ? l2.val : 0;
    		int v = v1 + v2 + flag;
    		flag = v/10;
    		node = new ListNode(v%10);
    		//node.next = null;
    		pre.next = node;
    		pre = node;
            l1 = l1!=null ? l1.next : null;  //不能直接写成l1 = l1.next ,l1为空时会空指针异常，注意
    	    l2 = l2!=null ? l2.next : null; 
    	}
    	if(flag==1) {
    		node = new ListNode(1);
    		//node.next = null;
    		pre.next = node;	
    	}
        
        return head.next;
    }
}