[LeetCode]2. Add Two Numbers
来源:互联网 发布:易石软件怎样用 编辑:程序博客网 时间:2024/06/12 20:54
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.
Example
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Discussion
这个问题比较简单,相当于实现一个基于链表的超大数加法。需要注意的地方就是进位的处理。
算法的时间复杂度为O(n)
。
C++ Code
/** * 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 * answer = new ListNode(0); ListNode * p = answer; int flag = 0; while(l1 || l2 || flag) { int sum = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + flag; p->next = new ListNode(sum % 10); p = p->next; flag = sum / 10; l1 = l1 ? l1->next : l1; l2 = l2 ? l2->next : l2; } return answer->next; }};
阅读全文
0 0
- [LeetCode]2.Add Two Numbers
- LeetCode 2.Add Two Numbers
- LeetCode --- 2. Add Two Numbers
- [Leetcode] 2. Add Two Numbers
- 【leetcode】2. Add Two Numbers
- leetcode 2. Add Two Numbers
- LeetCode-2.Add Two Numbers
- [leetcode] 2. Add Two Numbers
- 【LeetCode】2. Add Two Numbers
- LeetCode - 2. Add Two Numbers
- LeetCode 2.Add Two Numbers
- LeetCode 2. Add Two Numbers
- Leetcode 2. Add Two Numbers
- 2. Add Two Numbers LeetCode
- leetcode 2. Add Two Numbers
- LeetCode-2. Add Two Numbers
- LeetCode 2. Add Two Numbers
- 2. Add Two Numbers----LeetCode
- Scala对MongoDB的增删改查操作
- Ubuntu16.04安装mongodb
- 过滤器和拦截器的区别简单几点
- 二叉树的中序遍历
- 在centos7下编译安装php7
- [LeetCode]2. Add Two Numbers
- linex 查看jpyter地址
- Java子类调用父类构造方法
- 机器学习-归一化、标准化
- 每日掌握一个Linux命令 之 bash shell 的内置命令 type
- 易飞安装在VMware虚拟机方法
- 论文发表费用
- 浅谈数位DP的记忆化搜索
- Ubuntu 扩大虚拟机系统磁盘空间 1