_1656.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.ArrayList;
importjava.util.List;
importjava.util.TreeMap;

publicclass_1656 {
publicstaticclassSolution1 {
publicstaticclassOrderedStream {
TreeMap<Integer, String> map;
intptr;
intlimit;

publicOrderedStream(intn) {
this.map = newTreeMap<>();
this.ptr = 1;
this.limit = n;
 }

publicList<String> insert(intid, Stringvalue) {
map.put(id, value);
List<String> result = newArrayList<>();
if (map.containsKey(ptr)) {
for (intkey = ptr; key <= limit; key++) {
if (map.containsKey(key)) {
result.add(map.get(key));
 } else {
break;
 }
 }
inti = id;
while (map.containsKey(i)) {
i++;
 }
ptr = i;
 }
returnresult;
 }
 }
 }
}