using System;

public class Program

{

    public static void Main()

    {

        Console.WriteLine("Add 2 numbers using linked list");

        int[] num1 = new int[3]{2,4,3};

        int[] num2 = new int[3]{5,6,4};

        ListNode currNode;

        ListNode l1 = new ListNode(2);

        l1.next = new ListNode(4);

        currNode = l1.next;

        currNode.next = new ListNode(3);

        ListNode l2 = new ListNode(5);

        l2.next = new ListNode(6);

        currNode = l2.next;

        currNode.next = new ListNode(4);

        Solution sol = new Solution();

        Console.WriteLine("result=" + l1.val);

        Console.WriteLine("result=" + l2.val);

        ListNode result = sol.AddTwoNumbers(l1, l2);

        Console.WriteLine("result=" + result.val);

        while(result != null)

        {

            Console.WriteLine(result.val);

            result = result.next;

        }

    }

}

​

/**

 * Definition for singly-linked list.

 * public class ListNode {

 *     public int val;

 *     public ListNode next;

 *     public ListNode(int x) { val = x; }

 * }

 */

​

public class ListNode {

      public int val;

      public ListNode next;

    public ListNode(int x) { val = x; }

}

public class Solution {

    public ListNode AddTwoNumbers(ListNode l1, ListNode l2) {

        int carry = 0;

        int sum = 0;

        ListNode result = new ListNode(0);

        ListNode node = result; 

        while (l1 != null || l2 != null)

        {

            sum = 0;

            Console.WriteLine("in");

            if (l1 != null){

                sum += l1.val;

                l1 = l1.next;

            }

            if (l2 != null) {

                sum += l2.val;

                l2 = l2.next;

            }

            sum += carry;

            carry = sum /10;

            sum = sum % 10;

            Console.WriteLine(sum + " + " + carry);

            node.next = new ListNode(sum);

            Console.WriteLine(node.val);

            node = node.next;

        }

        if (carry > 0)

        {

            node.next = new ListNode(carry);

        }

        return result.next;

    }

}