Leetcode Problem 1146. Snapshot Array

1146. Snapshot Array

Leetcode Solutions

Initialize a list of lists, where each sublist represents the history of changes for an element in the array, with an initial record of [0, 0].
When set(index, val) is called, append a new record [current_snap_id, val] to the history of the specified index.
When snap() is called, increment the current_snap_id and return the previous ID.
When get(index, snap_id) is called, perform a binary search on the history of the specified index to find the record with the greatest snapshot ID that is less than or equal to snap_id, and return the associated value.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen