力扣刷题02

力扣刷题02

题目

力扣刷题02

解析

public static void main( String[] args ){
        int[] num1 = new int[]{2,4,3};
        int[] num2 = new int[]{5,6,4};
        ListNode medianSortedArrays = addTwoNumbers(num1, num2);
        System.out.println(medianSortedArrays);
    }
 public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode pre = new ListNode(0);
        ListNode cur = pre;
        int carry = 0;
        while(l1 != null || l2 != null) {
            int x = l1 == null ? 0 : l1.val;
            int y = l2 == null ? 0 : l2.val;
            int sum = x + y + carry;
            
            carry = sum / 10;
            sum = sum % 10;
            cur.next = new ListNode(sum);

            cur = cur.next;
            if(l1 != null)
                l1 = l1.next;
            if(l2 != null)
                l2 = l2.next;
        }
        if(carry == 1) {
            cur.next = new ListNode(carry);
        }
        return pre.next;
    }
上一篇:tek 把你从牛角尖钻出来的node list算法题


下一篇:合并两个顺序队列为一个新的队列