CPMagical CP Library

Problem solution · C++

Design Skiplist

Design Skiplist: a C++ solution using stack-based processing. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Stack-based processing
Source
walkccc LeetCode Solutions
Length
61 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Stack-based processing

For Design Skiplist, the implementation keeps unresolved items in last-in, first-out order, often to match boundaries, parse structure, or maintain monotonic candidates.

  1. Define what every stack entry represents.
  2. Pop entries once the current item resolves or invalidates them.
  3. Push the current item with only the information later steps need.

Code notes

  • 61 lines of C++ from the credited upstream file 1206.cpp.
  • The implementation keeps its working state in language-native values and containers.
  • 5 loop blocks detected.

Complexity

If each item is pushed and popped at most once, the stack work is linear.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeDesign Skiplist · C++C++
Use this to learn the idea, then write your own version.
struct Node {  int val = -1;  shared_ptr<Node> next;  shared_ptr<Node> down;}; class Skiplist { public:  bool search(int target) {    for (shared_ptr<Node> node = dummy; node; node = node->down) {      advance(node, target);      if (node->next && node->next->val == target)        return true;    }    return false;  }   void add(int num) {    // Collect nodes that are before the insertion point.    stack<shared_ptr<Node>> nodes;    for (shared_ptr<Node> node = dummy; node; node = node->down) {      advance(node, num);      nodes.push(node);    }     shared_ptr<Node> down;    bool shouldInsert = true;    while (shouldInsert && !nodes.empty()) {      shared_ptr<Node> prev = nodes.top();      nodes.pop();      prev->next = make_shared<Node>(num, prev->next, down);      down = prev->next;      shouldInsert = rand() % 2 == 1;    }     // Create a topmost new level dummy that points to the existing dummy.    if (shouldInsert)      dummy = make_shared<Node>(-1, nullptr, dummy);  }   bool erase(int num) {    bool found = false;    for (shared_ptr<Node> node = dummy; node; node = node->down) {      advance(node, num);      if (node->next && node->next->val == num) {        node->next = node->next->next;        found = true;      }    }    return found;  }  private:  shared_ptr<Node> dummy = make_shared<Node>(-1);   void advance(shared_ptr<Node>& node, int target) {    while (node->next && node->next->val < target)      node = node->next;  }};

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗