顺序遍历哈希表，使用固定长度数组，求解《1656. 设计有序流》

var OrderedStream = function(n) { // Map 实现
  this.h = new Map
  this.n = n
  this.ptr = 1
};

OrderedStream.prototype.insert = function(idKey, value) {
  this.h.set(idKey, value)
  const r = [] 
  while (this.ptr <= this.n && this.h.has(this.ptr)) {
    r.push(this.h.get(this.ptr++))
  }
  return r
};

var OrderedStream = function(n) { // 数组实现
  this.h = new Array(n + 1)
  this.n = n
  this.ptr = 1
};

OrderedStream.prototype.insert = function(idKey, value) {
  this.h[idKey] = value
  const r = [] 
  while (this.ptr <= this.n && this.h[this.ptr] !== void 0) {
    r.push(this.h[this.ptr++])
  }
  return r
};

var OrderedStream = function(n) { // Object 实现
  this.h = Object.create(null)
  this.n = n
  this.ptr = 1
};

OrderedStream.prototype.insert = function(idKey, value) {
  this.h[idKey] = value
  const r = [] 
  while (this.ptr <= this.n && this.h[this.ptr] !== void 0) {
    r.push(this.h[this.ptr++])
  }
  return r
};

class OrderedStream {
  h: Map<number, string>
  n: number
  ptr: number
  constructor(n: number) {
    this.h = new Map
    this.n = n
    this.ptr = 1
  }

  insert(idKey: number, value: string): string[] {
    this.h.set(idKey, value)
    const r: string[] = []
    while (this.ptr <= this.n && this.h.has(this.ptr)) {
      r.push(this.h.get(this.ptr++))
    }
    return r
  }
}

class OrderedStream {
  function __construct($n) {
    $this->n = $n;
    $this->h = array_fill(0, $n + 1, '');
    $this->ptr = 1;
  }

  function insert($idKey, $value) {
    $this->h[$idKey] = $value;
    $r = [];
    while ($this->ptr <= $this->n && $this->h[$this->ptr] !== '') {
      $r []= $this->h[$this->ptr++];
    }
    return $r;
  }
}

type OrderedStream struct {
  n int
  ptr int 
  h map[int]string
}

func Constructor(n int) OrderedStream {
  return OrderedStream{
    n,
    1,
    make(map[int]string, n + 1),
  }
}

func (this *OrderedStream) Insert(idKey int, value string) []string {
  this.h[idKey] = value
  var r []string
  for this.ptr <= this.n && this.h[this.ptr] != "" {
    r = append(r, this.h[this.ptr])
    this.ptr++
  }
  return r
}

class OrderedStream {
  private int n;
  private int ptr;
  private String[] h;
  public OrderedStream(int n) {
    this.n = n;
    ptr = 1;
    h = new String[n + 1];
  }

  public List<String> insert(int idKey, String value) {
    h[idKey] = value;
    List<String> r = new ArrayList<String>();
    while (ptr <= n && h[ptr] != null) {
      r.add(h[ptr++]);
    }
    return r;
  }
}

public class OrderedStream {
  private int n;
  private int ptr = 1;
  private string[] h;
  public OrderedStream(int n) {
    this.n = n;
    h = new string[n + 1];
  }

  public IList<string> Insert(int idKey, string value) {
    h[idKey] = value;
    IList<string> r = new List<string>();
    while (ptr <= n && h[ptr] != null) {
      r.Add(h[ptr++]);
    }
    return r;
  }
}

typedef struct {
  int n;
  int ptr;
  char** h;
} OrderedStream;

OrderedStream* orderedStreamCreate(int n) {
  OrderedStream* obj = malloc(sizeof(OrderedStream));
  obj->n = n;
  obj->ptr = 1;
  obj->h = malloc(sizeof(char*) * (n + 1));
  for (int i = 0; i <= n; i++) {
    obj->h[i] = NULL;
  }
  return obj;
}

char ** orderedStreamInsert(OrderedStream* obj, int idKey, char * value, int* retSize) {
  obj->h[idKey] = value;
  char** r = malloc(sizeof(char*) * obj->n);
  int pos = 0;
  while (obj->ptr <= obj->n && obj->h[obj->ptr] != NULL) {
    r[pos++] = obj->h[obj->ptr++];
  }
  *retSize = pos;
  return r;
}

void orderedStreamFree(OrderedStream* obj) {
  free(obj->h);
  free(obj);
}

class OrderedStream {
private:
  int n;
  int ptr;
  vector<string> h;
public:
  OrderedStream(int n) {
    this->n = n;
    ptr = 1;
    h = vector<string>(n + 1, "");
  }

  vector<string> insert(int idKey, string value) {
    h[idKey] = value;
    vector<string> r;
    while (ptr <= n && h[ptr] != "") {
      r.push_back(h[ptr++]);
    }
    return r;
  }
};

class OrderedStream:
  def __init__(self, n: int):
    self.n, self.ptr, self.h = n, 1, [''] * (n + 1)

  def insert(self, idKey: int, value: str) -> List[str]:
    self.h[idKey] = value
    r = []
    while self.ptr <= self.n and self.h[self.ptr] != '':
      r.append(self.h[self.ptr])
      self.ptr += 1
    return r