[leetcode] [java] add two numbers

题目

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.

解题

主要是链表的操作
注意每一个节点的值是什么，存在进位

代码

链表结构体

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

两数相加

import java.util.*;
public class AddTwoNumbers {
	public static void main(String[] args) {
		ListNode l1 = new ListNode(2);
		l1.next = new ListNode(4);
		l1.next.next = new ListNode(3);
		l1.next.next.next = new ListNode(9);
		ListNode l2 = new ListNode(5);
		l2.next = new ListNode(6);
		l2.next.next = new ListNode(4);
		l2.next.next.next = new ListNode(1);
		
		ListNode ret = null;
		ListNode tmp = null;
		int val1 = 0;
		int val2 = 0;
		int carry = 0;
		int sum = 0;
		while(l1 != null || l2 != null || carry != 0) {
			val1 = l1==null ? 0 : l1.val;
			val2 = l2==null ? 0 : l2.val;
			sum = val1 + val2 + carry ; 
			if(sum >= 10) {
				carry = 1;
				sum = sum - 10;
			} else {
				carry = 0;
			}
			if(ret == null) {
				ret = new ListNode(sum);
				tmp = ret;
			} else {
				tmp.next = new ListNode(sum);
				tmp = tmp.next;
			}
			
			l1 = l1==null ? null : l1.next;
			l2 = l2==null ? null : l2.next;
			
		}
		while(ret != null) {
			System.out.println(ret.val);
			ret = ret.next;
		}
	}
}