445. Add Two Numbers II

[Shawngbk]

/**

• 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) { Stack s1 = new Stack(); Stack s2 = new Stack(); while(l1 != null) { s1.push(l1.val); l1 = l1.next; } while(l2 != null) { s2.push(l2.val); l2 = l2.next; } int sum = 0; ListNode flag = new ListNode(0); ListNode d = flag; while(!s1.empty() || !s2.empty()) { //sum /= 10; if(!s1.empty()) sum += s1.pop(); if(!s2.empty()) sum += s2.pop(); flag.val = sum%10; ListNode head = new ListNode(sum/10); head.next = flag; flag = head; sum /= 10; } if(sum / 10 != 0) { flag.val = sum/10; } return flag.val == 0 ? flag.next : flag; } }