题目描述:
输入输出Demo:

解析:
本题属于Medium题,本质就是使用list模拟整数的加法
/*** 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) {int jw = 0; //表进位 0或1ListNode dummy = new ListNode(-1);ListNode cur = dummy;while (l1 != null || l2 != null) {int num1 = l1 == null ? 0 : l1.val;int num2 = l2 == null ? 0 : l2.val;int sum = num1 + num2 + jw;jw = sum / 10; //是否需要进位sum %= 10; //最后存入链表中的值cur.next = new ListNode(sum);cur = cur.next;if (l1 != null) {l1 = l1.next;}if (l2 != null) {l2 = l2.next;}}if (jw == 1) {cur.next = new ListNode(jw); //保证了最后一个数相加需要进位 例如99+99=198}return dummy.next;}}
