LeetCode 2 Add Two Numbers

Add Two Numbers

  Total Accepted: 58913  Total Submissions: 270240 My Submissions

Question  Solution 

You are given two linked lists representing two non-negative numbers. 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.

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

题目的意思是：

有两个链表，分别从开头开始遍历，将两个链表的对应的值相加（例如2+5=7,4+6=10,3+4=7）。

当相加的值（设为val）大于等于10的时候，例如6+4=10，要进位，这个进位的值设为（flag）即flag=val%10，而真正得到val=val/10，所以结果为6+4=0；flag=1；

最后3+4+flag=8

注意：

输入的两个链表是按头插入的创建的

最后结果的链表是按尾插入创建的

要考虑的是两个链表的大小不一致的情况

最后两个链表都遍历完了而flag！=0的时候需要创建一个节点加入到链尾。

下面是代码：

class ListNode {
	int val;
	ListNode next;

	ListNode(int x) {
		val = x;
	}

	ListNode() {

	}
}

public class TwoNumbers {

	public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
		if (l1 == null)
			return l2;
		if (l2 == null)
			return l1;
		ListNode header = null, rear = null;
		int flag = 0;

		while (l1 != null || l2 != null) {
			int val = 0;
			if (l1 == null) {
				val = l2.val + flag;
				flag = val / 10;
				val = val % 10;
				l2 = l2.next;

			} else if (l2 == null) {
				val = l1.val + flag;
				flag = val / 10;
				val = val % 10;
				l1 = l1.next;

			} else {

				val = l1.val + l2.val + flag;
				flag = val / 10;
				val = val % 10;
				l1 = l1.next;
				l2 = l2.next;

			}
			ListNode node = new ListNode(val);
			if (header == null) {
				header = node;
			}
			if (rear == null)// 尾插入法
				rear = node;
			else {
				rear.next = node;
				rear = rear.next;

			}

		}
		if (flag != 0 && rear != null) {// 如果两个链表都遍历完了而flag！=0时，需要创建一个节点，节点的大小为flag，插入到链尾
			rear.next = new ListNode(flag);
		}

		return header;
	}

	public static void main(String[] args) {
		// 测试代码
		int[] a = { 3, 4, 2 };
		int[] b = { 4, 6, 5 };
		ListNode header1 = new ListNode();
		ListNode header2 = new ListNode();
		for (int i = 0; i < a.length; i++) {
			ListNode node = new ListNode(a[i]);
			node.next = header1.next;// 头插入法
			header1.next = node;

		}

		for (int i = 0; i < b.length; i++) {
			ListNode node = new ListNode(b[i]);
			node.next = header2.next;
			header2.next = node;

		}

		TwoNumbers two = new TwoNumbers();
		ListNode l = two.addTwoNumbers(header1.next, header2.next);
		while (l != null) {
			System.out.print(l.val + "->");
			l = l.next;
		}

	}

}