/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode result = new ListNode(0);
while(l1!=null||l2!=null)
{
int val1=0;
int val2=0;
if(l1!=null)
{
val1=l1.val;
l1=l1.next;
}
if(l2!=null)
{
val2=l2.val;
l2=l2.next;
}
if(val1+val2 < 10)
{
result.val+=val1+val2;
if(result.val>9)
{
result.val=result.val%10;
result.next=new ListNode(1);
}else{
result.next=new ListNode(0);
}
}else{
result.val+=(val1+val2)%10;
result.next=new ListNode(1);
}
result=result.next;
}
return l1;
}
}
problem2 leetcode
最新推荐文章于 2024-09-15 15:29:37 发布