题目:
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;
* next = null;
* }
* }
*/
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
int d = 0;
ListNode rtnList = new ListNode(0), l3 = rtnList;
while(l1 != null || l2 != null){
if(l1 != null){
d += l1.val;
l1 = l1.next;
}
if(l2 != null){
d += l2.val;
l2 = l2.next;
}
l3.next = new ListNode(d%10);
l3 = l3.next;
d = d/10;
}
if(d == 1){
ListNode n = new ListNode(1);
l3.next = n;
}
return rtnList.next;
}
}
学习:
l3和rtnList都是引用,指向同一个对象,用l3来改变对象内容,最后返回rtnList该对象。