关键知识点:
1、链表的操作都会新增一个头节点struct ListNode *res并且分配内存,同时返回头指针时应返回res->next,关于头指针和头节点可以参考以下的blog:https://www.cnblogs.com/youxin/p/3279391.html
2、新建链表节点时,一定要记住对于末尾的链表指针赋值NULL,否则会出现内存分配错误,如下:res_cur->next->next = NULL;
解题思路:
1、链表两数相加,要考虑两数非空和进位的问题,算法上相对比较简单,注意使用current节点,降低过程数据处理的复杂度,这个在链表的处理过程中比较常见。
struct ListNode* addTwoNumbers(struct ListNode* l1, struct ListNode* l2){
struct ListNode *l1_cur = l1;
struct ListNode *l2_cur = l2;
struct ListNode *res = (struct ListNode *)malloc (sizeof(struct ListNode));
struct ListNode *res_cur = res;
int carrybit = 0;
while (l1_cur !=NULL || l2_cur !=NULL || carrybit){
int m1,m2,sum;
if(l1_cur != NULL){
m1 = l1_cur->val;
l1_cur = l1_cur -> next;
}
else{
m1 = 0;
}
if(l2_cur != NULL){
m2 = l2_cur -> val;
l2_cur = l2_cur -> next;
}
else{
m2 = 0;
}
res_cur -> next = (struct ListNode *) malloc(sizeof(struct ListNode));
res_cur->next->next = NULL;
sum = m1 + m2 + carrybit;
res_cur->next -> val = sum % 10;
carrybit = sum/10;
res_cur = res_cur->next;
}
return res->next;
}