题目：给定两个非空链表来表示两个非负整数，位数按照逆序方式储存，它们的每个节点只储存单个数字，将两数相加返回一个新的链表
示例：(2->4->3)+(5->6->4)
(7->0->8)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
|
public class ListNode{
int val;
ListNode next;
ListNode(int x) {val = x; }
}
public class Solution {
public ListNode addTwoNumbers(ListNode l1,ListNode l2) {
ListNode dummyHead = new ListNode(0);
ListNode p = l1 , q = l2 , curr = dummyHead;
//carry表示进位数
int carry = 0;
while(p != null || q != null) {
int x = (p != null) ? p.val : 0;
int y = (q != null) ? q.val : 0;
int sum = carry + x + y;
carry = sum / 10;
curr.next = new ListNode(sum%10);
curr = curr.next;
if (p != null) p = p.next;
if (q != null) q = q.next;
}
if (carry > 0) {
curr.next = new ListNode(carry);
}
return dummyHead.next;
}
}
|
近期评论