leetcode 2. Add Two Numbers

最新推荐文章于 2024-01-03 15:29:28 发布

sunnykema

最新推荐文章于 2024-01-03 15:29:28 发布

阅读量254

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/sunnykema/article/details/52506064

版权

leetcode 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

2. Add Two Numbers

My Submissions

Total Accepted: 177453
Total Submissions: 714115
Difficulty: Medium

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

/**
 * 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 pNode = null;
		ListNode pNext = null;
		ListNode pHead = null;
		int tmp = 0;
		while(l1 != null && l2 != null){
			pNext = new ListNode(l1.val+l2.val + tmp);
			tmp = pNext.val /10;
			pNext.val = pNext.val % 10;
			if(pHead == null){
				pHead = pNode = pNext;
			}else{
				pNode.next = pNext;
				pNode = pNext;
			}
			l1 = l1.next;
			l2 = l2.next;
		}
		
		while(l1 != null){
			pNext = new ListNode(l1.val + tmp);
			tmp = pNext.val /10;
			pNext.val = pNext.val % 10;
			pNode.next = pNext;
			pNode = pNext;
			l1 = l1.next;
		}
		
		while(l2 != null){
			pNext = new ListNode(l2.val + tmp);
			tmp = pNext.val /10;
			pNext.val = pNext.val % 10;
			pNode.next = pNext;
			pNode = pNext;
			l2 = l2.next;
		}
		
		if(tmp > 0){
			pNext = new ListNode(tmp);
			pNode.next = pNext;
		}
		return pHead;
    }
}