@@ -0,0 +1,1168 @@
+package LeeCode.addtwonumbers;%0A%0A/**%0A * %0A * 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.%0A%0AYou may assume the two numbers do not contain any leading zero, except the number 0 itself.%0A * Definition for singly-linked list.%0A * public class ListNode %7B%0A *     int val;%0A *     ListNode next;%0A *     ListNode(int x) %7B val = x; %7D%0A * %7D%0A * %0A * %0A */%0Aclass Solution %7B%0A    public ListNode addTwoNumbers(ListNode l1, ListNode l2) %7B%0A        ListNode start = new ListNode(0);%0A        ListNode head = start;%0A        int carry = 0;%0A        while (l1 != null %7C%7C l2 != null %7C%7C carry != 0) %7B%0A            ListNode cur = new ListNode(0);%0A            int tmp = 0;%0A            if (l1 != null) tmp += l1.val;%0A            if (l2 != null) tmp += l2.val;%0A            tmp += carry;%0A            carry = tmp / 10;%0A            cur.val = tmp %25 10;%0A            head.next = cur;%0A            head = cur;%0A            if (l1 != null) l1 = l1.next;%0A            if (l2 != null) l2 = l2.next;%0A        %7D%0A        return start.next;%0A    %7D%0A%7D

add two numbers code into leecode