Stack Push

Add an element to the top of a LIFO stack in constant time.

Time O(1) Space O(n) Stack push

How it works

Add an element to the top of a LIFO stack in constant time.

Implementation

      
 function stackPushOp(state, value) {
  const values = state.values;
  const top = values.length;
  probeSlot(top);
  values[top] = value;
  pushValue(top, value);
  finish(values.length);
} def stackPushOp(state, value):
    values = state.values
    top = values.length
    probeSlot(top)
    values[top] = value
    pushValue(top, value)
    finish(values.length) #include <vector>
#include <algorithm>
void stackPushOp(int state, int value) {
    auto values = state.values;
    auto top = values.length;
    probeSlot(top);
    values[top] = value;
    pushValue(top, value);
    finish(values.length);
} public void stackPushOp(int state, int value) {
    var values = state.values;
    var top = values.length;
    probeSlot(top);
    values[top] = value;
    pushValue(top, value);
    finish(values.length);
} #include <stdio.h>
void stackPushOp(int state, int value) {
    var values = state.values;
    var top = values.length;
    probeSlot(top);
    values[top] = value;
    pushValue(top, value);
    finish(values.length);
} 