Package g1101_1200.s1171_remove_zero_sum_consecutive_nodes_from_linked_list

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1171 - Remove Zero Sum Consecutive Nodes from Linked List.

    Medium

    Given the head of a linked list, we repeatedly delete consecutive sequences of nodes that sum to 0 until there are no such sequences.

    After doing so, return the head of the final linked list. You may return any such answer.

    (Note that in the examples below, all sequences are serializations of ListNode objects.)

    Example 1:

    Input: head = 1,2,-3,3,1

    Output: 3,1 Note: The answer 1,2,1 would also be accepted.

    Example 2:

    Input: head = 1,2,3,-3,4

    Output: 1,2,4

    Example 3:

    Input: head = 1,2,3,-3,-2

    Output: 1

    Constraints:

    • The given linked list will contain between 1 and 1000 nodes.

    • Each node in the linked list has -1000 <= node.val <= 1000.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final ListNode removeZeroSumSublists(ListNode head)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait