LeetCode 两数相加

两数相加

链表处理

singly-linked list 单链表处理，主要是temp临时链表和next节点处理

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		ListNode result = new ListNode(0);
		ListNode temp = result;
		int carry = 0;
		while (l1 != null || l2 != null) {
			int x = (l1 != null) ? l1.val : 0;
			int y = (l2 != null) ? l2.val : 0;
			carry = carry + x + y;
			temp.next = new ListNode(carry % 10);
            temp = temp.next;
			carry = carry / 10;
			if (l1 != null)
				l1 = l1.next;
			if (l2 != null)
				l2 = l2.next;
		}
		if (carry > 0) {
			temp.next = new ListNode(carry);
		}
		return result.next;
    }
}