File: root - text - article - 2019 - 11 - Remove-Consecutive-Nodes-that-Sum-to-0.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 223 Views, 21507 Search Bots | 146 Words
| Browse | Archive
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 223 Views, 21507 Search Bots | 146 Words
| Browse | Archive
Hi, here's your problem today. This problem was recently asked by Uber:
Given a linked list of integers, remove all consecutive nodes that sum up to 0.
Example:
Input: 10 -> 5 -> -3 -> -3 -> 1 -> 4 -> -4
Output: 10
The consecutive nodes 5 -> -3 -> -3 -> 1 sums up to 0 so that sequence should be removed. 4 -> -4 also sums up to 0 too so that sequence should also be removed.
Here's a starting point:
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 223 Views, 21507 Search Bots | 146 Words Given a linked list of integers, remove all consecutive nodes that sum up to 0.
Example:
Input: 10 -> 5 -> -3 -> -3 -> 1 -> 4 -> -4
Output: 10
The consecutive nodes 5 -> -3 -> -3 -> 1 sums up to 0 so that sequence should be removed. 4 -> -4 also sums up to 0 too so that sequence should also be removed.
Here's a starting point:
class Node:
def __init__(self, value, next=None):
self.value = value
self.next = next
def removeConsecutiveSumTo0(node):
# Fill this in.
node = Node(10)
node.next = Node(5)
node.next.next = Node(-3)
node.next.next.next = Node(-3)
node.next.next.next.next = Node(1)
node.next.next.next.next.next = Node(4)
node.next.next.next.next.next.next = Node(-4)
node = removeConsecutiveSumTo0(node)
while node:
print node.value,
node = node.next
# 10
Related Articles
- Algorithm Interview: Convert Roman Numerals to Decimal
- Daily Interview Problem: Trapping Rainwater
- Daily Interview Problem: Look and Say Sequence
- Daily Interview Problem: Arithmetic Binary Tree
- Daily Interview Problem: Min Range Needed to Sort
- Daily Interview Problem: Word Ordering in a Different Alphabetical Order
- First and Last Indices of an Element in a Sorted Array
- Algorithm Interview Question: Find the Single Element in an Array of Duplicates
- Windows Scripting
- Daily Interview Problem: Largest Product of 3 Elements I
©2006~2024 SteakOverCooked - 0.01575 Seconds(s) - 3428.326 KB/s - 97 Online Memory: 520.41 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Comments (0)
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !