Leetcode两数相加java代码

Leetcode两数相加java代码

/**

• 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 p1 = l1, p2 = l2;
  ListNode dummy = new ListNode(-1);
  ListNode p = dummy;
  int carry = 0, newVal = 0;
  while (p1 != null || p2 != null || carry > 0) {
  newVal = (p1 == null ? 0: p1.val) + (p2 == null ? 0: p2.val) + carry;
  carry = newVal / 10;
  newVal %= 10;
  p.next = new ListNode(newVal);
  p1 = p1 == null? null: p1.next;
  p2 = p2 == null? null: p2.next;
  p = p.next;
  }
  return dummy.next;
  }
  }