题目
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
思路
链表是按倒序存储数字的,按照加法的原则从个位往上加,对两个数同一位上的数字求和,需要注意的是:1)如果同一位上两个数字的和超过10,需要进位;2)位数较低的那个数,在高位视作用0补齐
代码
/**
* 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) {
int num1 = 0, num2 = 0, num3 = 0;
int carryBit = 0;
ListNode ret = null, curr = null;
//one of input lists is null
if(l1 == null || l2 == null)
return ret;
ret = new ListNode(0);
curr = ret;
while(l1 != null || l2 != null) {
num1 = (l1 !=null) ? l1.val : 0;
num2 = (l2 !=null) ? l2.val : 0;
num3 = (num1 + num2 + carryBit) % 10;
carryBit = (num1 + num2 + carryBit >= 10) ? 1 : 0;
curr.next = new ListNode(num3);
curr = curr.next;
l1 = (l1 !=null) ? l1.next : l1;
l2 = (l2 !=null) ? l2.next : l2;
}
if(carryBit == 1) {
curr.next = new ListNode(1);
curr = curr.next;
}
return ret.next;
}
}