2.两数相加
给你两个 非空 的链表,表示两个非负的整数。它们每位数字都是按照 逆序 的方式存储的,并且每个节点只能存储 一位 数字。
请你将两个数相加,并以相同形式返回一个表示和的链表。
你可以假设除了数字 0 之外,这两个数都不会以 0 开头。
输入:l1 = [2,4,3], l2 = [5,6,4]
输出:[7,0,8]
解释:342 + 465 = 80
输入:l1 = [0], l2 = [0]
输出:[0]
输入:l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
输出:[8,9,9,9,0,0,0,1]
来源:力扣(LeetCode) 链接:力扣
下面这个案例采用了内部类的方式,可以肆无忌惮的访问或调用ListNote类中的属性或方法
import java.util.ArrayList;
import java.util.List;
public class ListNode {
private int val;
private ListNode next;
public ListNode() {}
public ListNode(int val) {
this.val = val;
}
public ListNode(int val, ListNode next) {
this.val = val; this.next = next;
}
//低阶版
//先将结果写入list集合,然后倒序遍历list集合,将结果写入ListNote链表
static class Solution3 {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode l=new ListNode();
List<Integer> list = new ArrayList<>();
boolean flag = false;//进位标志符
while (true){
if (l1==null&&l2==null) {
if (flag)list.add(1);//最后判断是否有进位
break;
}
int n1=0,n2=0;
if (l1!=null){
n1 = l1.val;
l1 = l1.next;
}
if (l2!=null){
n2 = l2.val;
l2 = l2.next;
}
int sum = n1+n2;
if (flag) {//查看是否进位
sum = sum + 1;
flag = false;
}
list.add(sum%10);//将个位数写入list集合
if (sum > 9){//判断是否要进位
flag = true;
}
}
for (int i = list.size()-1;i>=0;i--){
if (i == list.size()-1){
l = new ListNode(list.get(i));
}else{
l = new ListNode(list.get(i),l);
}
}
return l;
}
}
//测试
public static void main(String[] args) {
ListNode l1 = new ListNode(
9,new ListNode(4,new ListNode(7,new ListNode(9))));
ListNode l2 = new ListNode(5,new ListNode(6,new ListNode(4)));
ListNode ll = new Solution3().addTwoNumbers(l1,l2);
while (ll != null){
System.out.println(ll.val);
ll = ll.next;
}
}
}
如果不想使用内部类的方式,将ListNote类的get和set方法补齐。如下:
package com.liko.t1.bean;
public class ListNode1 {
private int val;
private ListNode1 next;
public int getVal() {
return val;
}
public void setVal(int val) {
this.val = val;
}
public ListNode1 getNext() {
return next;
}
public void setNext(ListNode1 next) {
this.next = next;
}
public ListNode1() {}
public ListNode1(int val) {
this.val = val;
}
public ListNode1(int val, ListNode1 next) {
this.val = val; this.next = next;
}
}
测试类
package com.liko.t1;
import com.liko.t1.bean.ListNode1;
public class testListNode1 {
public static void main(String[] args) {
ListNode1 l1 = new ListNode1(
9,new ListNode1(4,new ListNode1(7,new ListNode1(9))));
ListNode1 l2 = new ListNode1(5,new ListNode1(6,new ListNode1(4)));
ListNode1 ll = new SolutionListNode1().addTwoNumbers(l1,l2);
while (ll != null){
System.out.println(ll.getVal());
ll = ll.getNext();
}
}
}
//进阶版
//使用指针的方式,直接将结果写入ListNote链表
class SolutionListNode1{
public ListNode1 addTwoNumbers(ListNode1 l1, ListNode1 l2) {
ListNode1 l = new ListNode1();
ListNode1 ne = l;
int carry = 0;//进位符
while(l1!=null||l2!=null){
int l1_val = (l1 == null?0:l1.getVal());
int l2_val = (l2 == null?0:l2.getVal());
int sum = l1_val+l2_val+carry;
carry = sum/10;
sum%=10;
ne.setNext(new ListNode1(sum));
ne = ne.getNext();//将指针指向下一位
if (l1!=null)l1 = l1.getNext();
if (l2!=null)l2 = l2.getNext();
}
if (carry == 1)ne.setNext(new ListNode1(carry));
return l.getNext();
}
}