链表相加算法

最新推荐文章于 2022-09-29 15:58:38 发布

nzch

最新推荐文章于 2022-09-29 15:58:38 发布

阅读量112

点赞数

分类专栏：刷题

本文链接：https://blog.csdn.net/qq_28764557/article/details/119635990

版权

刷题专栏收录该内容

18 篇文章 0 订阅

订阅专栏

https://www.nowcoder.com/practice/c56f6c70fb3f4849bc56e33ff2a50b6b?tpId=188&&tqId=38610&rp=1&ru=/activity/oj&qru=/ta/job-code-high-week/question-ranking

import java.util.*;
 
/*
 * public class ListNode {
 *   int val;
 *   ListNode next = null;
 * }
 */
 
public class Solution {
    /**
     *
     * @param head1 ListNode类
     * @param head2 ListNode类
     * @return ListNode类
     */
     //翻转链表
    public static ListNode ReverseList(ListNode pHead) {
        ListNode res = null;
        ListNode cur = pHead;
        while(cur != null){
            ListNode temp = cur.next;
            cur.next = res;
            res = cur;
            cur = temp;
        }
        return res;
    }
    public ListNode addInList (ListNode head1, ListNode head2) {
        ListNode l1 = ReverseList(head1);//翻转链表l1
        ListNode l2 = ReverseList(head2);//翻转链表l2
        ListNode res = null;// 用于返回的链表
        int cnt = 0;//如果两个值的加和>10，就会产生进位，这个用来存储进位
        while(l1 != null || l2 != null){
            int x1 = l1==null? 0 : l1.val;
            int x2 = l2==null? 0 : l2.val;
            int sum = x1 + x2 + cnt;//当前这一位的总和
            cnt = sum / 10;//查看当前加和是否有进位
            ///进行当前节点的插入
            ListNode tempNode = new ListNode(sum % 10);
            tempNode.next = res;
            res = tempNode;
            l1 = l1==null? null: l1.next;
            l2 = l2==null? null: l2.next;
        }
        ///如果cnt>0那么就说明存在进位还得插入一个节点
        if(cnt > 0){
            ListNode tempNode = new ListNode(cnt);
            tempNode.next = res;
            res = tempNode;
        }
        return res;
 
    }
}

我的解法：

import java.util.*;

/*
 * public class ListNode {
 *   int val;
 *   ListNode next = null;
 * }
 */

public class Solution {
    /**
     * 
     * @param head1 ListNode类 
     * @param head2 ListNode类 
     * @return ListNode类
     */
    public ListNode addInList (ListNode head1, ListNode head2) {
        // 翻转两个链表
        ListNode l1 = ReverseList(head1);
        ListNode l2 = ReverseList(head2);
        // 进位 返回的链表的表头
        int cnt = 0;
        ListNode res = null;
        // 不断的累加
        while(l1!=null||l2!=null){
            int x1 = l1==null? 0 : l1.val;
            int x2 = l2==null? 0 : l2.val;
            int sum = x1+x2+cnt;
            cnt = sum/10;
            // 将这个几点写到链表，注意是头插
            ListNode tempNode = new ListNode(sum%10);
            tempNode.next = res;
            res = tempNode;
            // 前进
            l1 = l1==null? null: l1.next;
            l2 = l2==null? null: l2.next;
        }
        // 如果残留进位则说明进位是有值的需要再加一个节点
        if(cnt > 0){
            ListNode tempNode = new ListNode(cnt);
            tempNode.next = res;
            res = tempNode;
        }
      return res;
    }
    public ListNode ReverseList(ListNode head) {
        if(head==null||head.next==null){
            return head;
        }
        ListNode headAfter = ReverseList(head.next);
        head.next.next = head;
        head.next = null;
        return headAfter;
    }
}