Leetcode题目分析 2. Add Two Numbers

最新推荐文章于 2024-09-16 06:54:08 发布

huiya9527

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量195

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/huiya9527/article/details/50726110

版权

leetcode 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

这道题感觉是对链表基本用法的考察，有些细节需要注意，但是题目本身并不复杂！

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode resultHead = new ListNode(0);
        ListNode pointer = resultHead;
        //表示上次相加是否产生进位。
        int remain = 0;
        while(true){
            if(l1 == null && l2 == null){
                break;
            } else if(l1 == null && l2 != null){
                if(l2.val + remain >= 10){
                    pointer.next = new ListNode(l2.val + remain - 10);
                    remain = 1;
                } else{
                    pointer.next = new ListNode(l2.val + remain);
                    remain = 0;
                }
                l2 = l2.next;
                pointer = pointer.next;

            } else if(l1 != null && l2 == null){
                if(l1.val + remain >= 10){
                    pointer.next = new ListNode(l1.val + remain - 10);
                    remain = 1;
                } else{
                    pointer.next = new ListNode(l1.val + remain);
                    remain = 0;
                }
                l1 = l1.next;
                pointer = pointer.next;
            } else{
                if(l1.val + l2.val + remain >= 10){
                    pointer.next = new ListNode(l1.val + l2.val + remain - 10);
                    remain = 1;
                } else{
                    pointer.next = new ListNode(l1.val + l2.val + remain);
                    remain = 0;
                }
                l1 = l1.next;
                l2 = l2.next;
                pointer = pointer.next;
            }
        }
        if(remain == 1){
            pointer.next = new ListNode(1);
        }
        return resultHead.next;
    }
}