René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Merge Nodes in Between Zeros(python or cpp only)","articleBody":"Hey! Everyone..Please Help me with my today's Leetcode problem. \r\nYou are given the head of a linked list, which contains a series of integers separated by 0's. The beginning and end of the linked list will have Node.val == 0.\r\n\r\nFor every two consecutive 0's, merge all the nodes lying in between them into a single node whose value is the sum of all the merged nodes. The modified list should not contain any 0's.\r\n\r\nReturn the head of the modified linked list.\r\n\r\n\r\nExample 1:\r\n\r\n\r\nInput: head = [0,3,1,0,4,5,2,0]\r\nOutput: [4,11]\r\nExplanation: \r\nThe above figure represents the given linked list. The modified list contains\r\n- The sum of the nodes marked in green: 3 + 1 = 4.\r\n- The sum of the nodes marked in red: 4 + 5 + 2 = 11.\r\n\r\nExample 2:\r\n\r\nInput: head = [0,1,0,3,0,2,2,0]\r\nOutput: [1,3,4]\r\nExplanation: \r\nThe above figure represents the given linked list. The modified list contains\r\n- The sum of the nodes marked in green: 1 = 1.\r\n- The sum of the nodes marked in red: 3 = 3.\r\n- The sum of the nodes marked in yellow: 2 + 2 = 4.\r\n \r\nConstraints:\r\nThe number of nodes in the list is in the range [3, 2 * 10^5].\r\n0 \u003c= Node.val \u003c= 1000\r\nThere are no two consecutive nodes with Node.val == 0.\r\nThe beginning and end of the linked list have Node.val == 0.","author":{"url":"https://github.com/ArmanKumar21","@type":"Person","name":"ArmanKumar21"},"datePublished":"2022-10-15T07:45:32.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":4},"url":"https://github.com/110/python-cpp-html-programs-projects/issues/110"}