title: LeetCode 02. Add Two Numbers
date: 2018-04-06 22:30:00
summary:
categories: LeetCode
note:上学时的刷题笔记,如有错误,敬请指正。
方法一:遍历链表
时间复杂度:O(N)
备注:通过。
代码:
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
ListNode* Head = new ListNode(0);
ListNode* Curr = Head;
int push = 0;
while(l1 || l2){
int n1 = l1 ? l1->val : 0;
int n2 = l2 ? l2->val : 0;
int sum =n1+n2+push;
push = sum/10;
ListNode *nodeptr=new ListNode(sum%10);
Curr->next = nodeptr;
Curr = Curr->next;
l1 = l1 ? l1->next : l1;
l2 = l2 ? l2->next : l2;
}
if(push){
ListNode *nodeptr=new ListNode(push);
Curr->next = nodeptr;
}
return Head->next;
}
};