leetscode 的第二题
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.
好久都没有接触到listnode,做这道题真的是很好的复习了一次
简单说一下listnode
其实万变不离其宗,最重要的就是ListNode类,最重要的是了解head,next,和val
首先一定要先定义,一般还是给一个具体数值,不建议null
因为会报错,报错,报错!
Exception in thread "main" java.lang.NullPointerException at Solution.addTwoNumbers(Solution.java:22) at __DriverSolution__.__helper__(__Driver__.java:8) at __Driver__.main(__Driver__.java:54)
接着 设置head,一定要设置链表的head,否则不断循环后输出为空
这个图就是非常明显了
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode l3=new Listnode(0);//head
ListNode ab=l3;//第一个节点
int x=ab.val;//当前值
ab.next=new Listnode(3);//连接下一个节点
}
}
基本知识这些就可以了
那么放解答吧
/**
* 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) {
ListNode l3 = new ListNode(0);
ListNode ab=l3,ac=l1,b=l2;
int a=0;
while(ac!=null || b!=null){
int x=0;
int y=0;
if(ac!=null){
x=ac.val;
}
if(b!=null){
y=b.val;
}
int sum=x+y+a;
a=sum/10;
ab.next = new ListNode(sum%10);
ab=ab.next;
if(ac!=null) ac=ac.next;
if(b!=null) b=b.next;
}
if(a>0) ab.next=new ListNode(a);
return l3.next;
}
}