LeetCode题目: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.这套题目其实就是把两个数相加的过程模拟下,代码如下:
/**
* 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) {
if(l1 == null && l2 == null)
return null;
if(l1 == null){
return l2;
}
if(l2 == null){
return l1;
}
ListNode iter1 = l1;
ListNode iter2 = l2;
int v1 = iter1.val;
int v2 = iter2.val;
int sum = (v1 + v2) % 10;
int rem = (v1 + v2) / 10;
ListNode newList = new ListNode(sum);
ListNode newIter = newList;
iter1 = iter1.next;
iter2 = iter2.next;
while(iter1 != null && iter2 != null){
v1 = iter1.val;
v2 = iter2.val;
sum = (v1 + v2 + rem) % 10;
rem = (v1 + v2 + rem) / 10;
newIter.next = new ListNode(sum);
newIter = newIter.next;
iter1 = iter1.next;
iter2 = iter2.next;
}
ListNode iter = iter1 == null ? iter2 : iter1;
while(iter != null){
sum = (iter.val + rem) % 10;
rem = (iter.val + rem) / 10;
newIter.next = new ListNode(sum);
newIter = newIter.next;
iter = iter.next;
}
if(rem != 0){
newIter.next = new ListNode(rem);
}
return newList;
}
}
大家有更简洁的代码,欢迎留言~