Undo drawer: Peak ticket
Stuck or curious how this works? Visualize Stack Operations ↗
Inputs
readings is a list of integers (numbers with no decimal part). It may be empty, and numbers may repeat unless task 1 says otherwise.
Your tasks
- Create a list
stack. Use a stack, which is a pile where you add and remove items only at the top. Readreadingsfrom left to right. A number of 0 or more adds that number to the top. A negative number tells you how many top items to remove: -3 means remove up to three items. Stop if the stack becomes empty.stackis the final stack, from bottom to top. - Find the largest number in
stack. Store it inlargest. - Complete
undoDrawerPeakTicketso it returnslargest. Return it, do not print it.
Example
If readings is [6, 6, 7, 3, -8], then stack is [] and undoDrawerPeakTicket returns 0.
Rules
- If
stackis empty, return 0.
Test data
TEST DATA 1: readings is [5, 14, -7, 5, 0].
TEST DATA 2: readings is [5, 5, 5, -9].
Examples
Input: readings = [5,14,-7,5,0] Output: 5
stack is [5, 0]. The largest number is 5. Return 5.
Input: readings = [5,5,5,-9] Output: 0
stack is []. The list is empty, so return 0.
Input: readings = [] Output: 0
stack is []. The list is empty, so return 0.
Input limits
- 0 <= input size <= 50000.
- Answers fit in a signed 32-bit integer: -2,147,483,648 through 2,147,483,647.
- Input numbers have no decimal part. They range from -1,000,000 to 1,000,000. Follow any extra input rules in task 1.
Efficiency goal
Big-O describes how the work or memory needed grows as the input gets larger.
Efficiency goal: time O(n); extra memory, including the helper list, O(n). n is the input length. These labels describe how work and memory grow with the input.
Practice focus
Build stack first, then return exactly what the tasks ask for. Follow the order, keep repeated values when the rule says so, and check the empty case.