728x90
반응형
문제
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
Explanation:* 342 + 465 = 807.
문제풀이
두 개의 리스트 노드를 순회하면서 result 노드에 집어넣기.
주의할 점은 둘의 자릿수가 같지 않음.
시간 복잡도 O(n)
왜 문제를 풀지 못했는가? 어떤 부분을 생각하지 못했는가?
Source
'algorithm > leetcode' 카테고리의 다른 글
leetcode Employees Earning More Than Their Managers 풀이 (0) | 2020.09.30 |
---|---|
leetcode Reformat Department Table 풀이 (0) | 2020.09.29 |
[LeetCode] ReverseInteger (0) | 2020.07.11 |
[LeetCode] LongestSubstring (0) | 2020.07.11 |
[LeetCode] LongestPalindromicSubstring (0) | 2020.07.11 |
댓글