算法第二周Add Two Numbers[medium]
来源:互联网 发布:三维热传导模拟软件 编辑:程序博客网 时间:2024/06/05 09:30
Add Two Numbers [Medium]
Description
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Analysis
这个问题主要考察的是链表,通过链表来实现多位数的加法,需要注意的有以下几个问题:
- 使用链表指针时候要格外的注意,注意其为空的情况以及next指针的问题
- 再考虑加法时要考虑进位的问题,我使用了一个局部变量carry保存进位
- 多位数加法还要考虑两个加数的位数问题,我一开始是将这些情况分别加以讨论
- 特别要注意最后的结果是否需要进位
Solution
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) { ListNode* result = NULL; ListNode* p = l1; ListNode* q = l2; ListNode* temp = NULL; int carry = 0; while (p != NULL && q != NULL) { int r = p->val + q->val+carry; if ( r >= 10) { carry = 1; r = r%10; } else { carry = 0; } if (result == NULL) { result = new ListNode(r); temp = result; } else { temp->next = new ListNode(r); temp = temp->next; } p = p->next; q = q->next; } if (p == NULL) { while (q != NULL) { int r = carry + q->val; if ( r >= 10) { carry = 1; r = r%10; } else { carry = 0; } if (result == NULL) { result = new ListNode(r); temp = result; } else { temp->next = new ListNode(r); temp = temp->next; } q = q->next; } } if (q == NULL) { while (p != NULL) { int r = carry + p->val; if ( r >= 10) { carry = 1; r = r%10; } else { carry = 0; } if (result == NULL) { result = new ListNode(r); temp = result; } else { temp->next = new ListNode(r); temp = temp->next; } p = p->next; } } if (p == NULL && q == NULL&& carry != 0) { temp->next = new ListNode(1); } return result; }};
Discussion
上述解法通过了,但我发现我的代码特别的繁琐,有很多相同的代码,我就在想是否可以将某些情况合并而减少代码的重复。
经过改进:
class Solution {public: ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) { ListNode* result = NULL; ListNode* p = l1; ListNode* q = l2; ListNode* temp = NULL; int carry = 0; while (p != NULL || q != NULL) { int x = (p == NULL) ? 0 : p->val; int y = (q == NULL) ? 0 : q->val; int r = x + y+carry; if ( r >= 10) { carry = 1; r = r%10; } else { carry = 0; } if (result == NULL) { result = new ListNode(r); temp = result; } else { temp->next = new ListNode(r); temp = temp->next; } if (p != NULL ) p = p->next; if (q != NULL ) q = q->next; } if (carry != 0) { temp->next = new ListNode(1); } return result; }};
阅读全文
0 0
- 算法第二周Add Two Numbers[medium]
- (算法分析Week5)Add Two Numbers[Medium]
- Add Two Numbers [Medium]
- Add Two Numbers(medium)
- [Medium]Add Two Numbers
- LeetCode第二关:Add Two Numbers --> Difficulty: Medium
- 2. Add Two Numbers Medium
- Add Two Numbers算法
- Leet Code Medium 2 add two numbers
- <LeetCode><Medium>2 Add Two Numbers
- [2, Medium, C++] Add Two Numbers
- Leetcode 2. Add Two Numbers (Medium) (cpp)
- Leetcode #2 Add Two Numbers(medium)
- 2. Add Two Numbers 难度:Medium
- Medium 2题 Add Two Numbers
- 【leetcode】2. Add Two Numbers 【medium】
- Medium 445题 Add Two Numbers II
- 2. Add Two Numbers(Medium)
- tablayout导航栏
- python
- Windows编程基础- 设备对象属性
- POJ
- js 4种常用正则表达式
- 算法第二周Add Two Numbers[medium]
- Struts2-01-数据访问
- [poj 1679] The Unique MST---(翻译:次小生成树)
- 2017年9月17日训练总结
- hello world!
- [BZOJ]4419: [Shoi2013]发微博 set暴力
- 使用servlet导出excel表
- 调戏源码之Spring MVC(三)
- 三个整数排列大小