leetcode-2

leetcode-2

/*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.
*/

class Solution2 {
	  public class ListNode {
	      int val;
	      ListNode next;
	      ListNode(int x) { val = x; }
	  }
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        
        ListNode r=null;
        ListNode p1=l1;
        ListNode p2=l2;
        ListNode q=p1;
        int remain=0;
        while(p1!=null&&p2!=null){
                int data=p1.val+p2.val;
                p1.val=(data+remain)%10;
                remain=(data+remain)/10;
                q=p1;
                p1=p1.next;
                p2=p2.next;
                

         }
         while(p2!=null){
                int data=p2.val;
                q.next=new ListNode((data+remain)%10);
                remain=(data+remain)/10;
                q=q.next;
                p2=p2.next;
         }
         while(p1!=null){
                int data=p1.val;
                p1.val=(data+remain)%10;
                remain=(data+remain)/10;
                q=p1;
                p1=p1.next;
         }
        if(remain!=0){
             q.next=new ListNode(remain);
        }
        return l1;
    }
        
        
    
}