Linked List Jumps
You are given a singly linked list node containing positive integers. Return the same linked list where every node’s next points to the node val nodes ahead. If there’s no such node, next should point to null.
Constraints
n ≤ 100,000wherenis the number of nodes innode
https://binarysearch.com/problems/Linked-List-Jumps
ExamplesPermalink
Example 1Permalink
Input
- node =
Output
- answer =
Explanation
Note that 2’s next is 2 node ahead. 4’s next is out of bounds, so it’s set to null.
SolutionPermalink
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** | |
| * class LLNode { | |
| * public: | |
| * int val; | |
| * LLNode *next; | |
| * }; | |
| */ | |
| LLNode *solve(LLNode *node) | |
| { | |
| // keep this for final ans | |
| LLNode *res = node; | |
| while (node) | |
| { // repeat | |
| LLNode *curr = node; | |
| // jump "step" amount of times | |
| for (int i = node->val; i > 0 && node; i--) | |
| { | |
| node = node->next; | |
| } | |
| // assign | |
| curr->next = node; | |
| } | |
| return res; | |
| } |
Leave a comment