2.两数相加

暴力的小石头

已于 2022-06-20 15:03:26 修改

阅读量64

点赞数

分类专栏：算法文章标签：算法

于 2021-04-07 23:17:13 首次发布

本文链接：https://blog.csdn.net/lilei1138494584/article/details/115498851

版权

算法专栏收录该内容

3 篇文章 0 订阅

订阅专栏

题目：https://leetcode.cn/problems/add-two-numbers/
解法：
1.循环时间：o(n) 空间：o(1)

class Solution {
    ListNode root = new ListNode(0);
    ListNode head = root;
    int isAdd = 0;
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
       while(l1 != null || l2 != null || isAdd != 0){
           int sum = (l1 != null ? l1.val : 0) + (l2 != null ? l2.val : 0) + isAdd;
           isAdd = sum / 10;
           head.next = new ListNode(sum % 10);
           head = head.next;
           if(l1 != null) l1 = l1.next;
           if(l2 != null) l2 = l2.next;
       }
       return root.next;    
    }
}

2.递归时间：o(n) 空间：o(n)

class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
       return dfs(l1,l2,0);
    }

    public ListNode dfs(ListNode l1, ListNode l2, int isAdd){
        if(l1 == null && l2 == null && isAdd == 0) return null;
        int sum = (l1 == null ? 0 : l1.val) + (l2 == null ? 0 : l2.val) + isAdd;
        ListNode node = new ListNode(sum % 10);
        node.next = dfs((l1 != null ? l1.next : null),(l2 != null ? l2.next : null), (sum / 10));
        return node;
    }
}