Leetcode——2. Add Two Numbers

问题: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

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


你可能感兴趣的:(Leetcode——2. Add Two Numbers)