2. Add Two Numbers 【Medium】

avatar 2020年08月29日14:30:57 6 1980 views
博主分享免费Java教学视频,B站账号:Java刘哥

Question

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example:

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

My Answer

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        ListNode c1 = l1;
        ListNode c2 = l2;
        ListNode head = new ListNode(0); // 虚拟头结点
        ListNode curr = head;
        int carry = 0;
        while(c1 != null || c2 != null) {
            int x = (c1 != null) ? c1.val : 0;
            int y = (c2 != null) ? c2.val : 0;
            int sum = carry + x + y;
            carry = sum / 10;
            
            curr.next = new ListNode(sum % 10);
            curr = curr.next;
            
            if(c1 != null) {
                c1 = c1.next;
            }
            if(c2 != null) {
                c2 = c2.next;
            }
        }
        
        // 解决最后一个结点之间的相加进位的情况
        if(carry > 0) {
            curr.next = new ListNode(carry);
        }
        return head.next;
    }
}
  • 微信
  • 交流学习,有偿服务
  • weinxin
  • 博客/Java交流群
  • 资源分享,问题解决,技术交流。群号:590480292
  • weinxin
avatar

发表评论

avatar 登录者:匿名
匿名评论,评论回复后会有邮件通知

  

已通过评论:0   待审核评论数:0