class Solution { public ListNode AddTwoNumbers(ListNode l1, ListNode l2) { ListNode dummyHead = new ListNode(0); if (l1 == null && l2 == null) return dummyHead; int carry = 0; ListNode curr = dummyHead; while (l1 != null || l2 != null) { int num1 = l1?.val ?? 0; int...
publicclassSolution { publicListNode addTwoNumbers(ListNode l1, ListNode l2) { //如果给出就为空,则直接返回另外一个链表 if(l1 ==null)returnl2; if(l2 ==null)returnl1; intflag =0;//存放进位信息,但是并不是处理最后的进位标志 //构造返回结果的第一个节点 ListNode result =newListNode((l1.val ...
leetcode C++ Add two Numbers 28msclass Solution { public: ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) { ListNode *sum = new ListNode(-1); ListNode *index = sum; int b = 0; while(l1||l2) {int l1v = l1?l1->val:0
} Solution s=newSolution(); tmp=s.addTwoNumbers(node1, node2);while(tmp !=null) { System.out.format("%d ", tmp.val); tmp=tmp.next; } }publicListNode addTwoNumbers(ListNode l1, ListNode l2) { ListNode head=newListNode(0); ListNode cur_node=head;intcarry = 0;while(l1 !=null||...
publicstaticListNodeaddTwoNumbers(ListNode l1,ListNode l2){// 边界条件判断if(l1==null){returnl2;}elseif(l2==null){returnl1;}ListNode head=newListNode(0);ListNode point=head;int carry=0;while(l1!=null&&l2!=null){int sum=carry+l1.val+l2.val;ListNode rest=newListNode(sum%10);point.next...
# Definition for singly-linked list. # class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next class Solution: def addTwoNumbers(self, l1: ListNode, l2: ListNode) -> ListNode: link1 = l1 link2 = l2 while(link1!=None and link2 !=None...
class Solution { public ListNode addTwoNumbers(ListNode l1, ListNode l2) { //初始化为0的节点 ListNode init = new ListNode(0); //当前输出节点位置,初始化为initListNode ListNode current = init; //进位值 int carry = 0; while (l1 != null || l2 != null) { ...
# class ListNode: # def __init__(self, val=0, next=None): # self.val = val # self.next = next class Solution: def addTwoNumbers(self, l1: Optional[ListNode], l2: Optional[ListNode]) -> Optional[ListNode]: # 哨兵结点,方便后续处理 head_pre = ListNode(0) # 结果链表的尾结点,方便...
classSolution{public:ListNode*addTwoNumbers(ListNode*l1,ListNode*l2){ListNode*ret=newListNode();ListNode*pnt=ret;bool carry=false;while(l1!=nullptr||l2!=nullptr||carry){int cur=0;if(l1!=nullptr){cur+=l1->val;l1=l1->next;}if(l2!=nullptr){cur+=l2->val;l2=l2->next;}if(carry){cur...
public class Solution { /* * 方法1 */ public static ListNode addTwoNumbers(ListNode l1,ListNode l2) { //如果都为空 直接返回不为空的一个参数 如果都未空 则返回空 if(l1 == null || l2 == null){ return l1 == null ?(l2 == null ?null:l2):l1; ...