设计有序流

设计有序流

1656. Design an Ordered Stream
      There is a stream of n (idKey, value) pairs arriving in an arbitrary order, where idKey is an integer between 1 and n and value is a string. No two pairs have the same id.
      Design a stream that returns the values in increasing order of their IDs by returning a chunk (list) of values after each insertion. The concatenation of all the chunks should result in a list of the sorted values.
      Implement the OrderedStream class:
      OrderedStream(int n) Constructs the stream to take n values.
      String[] insert(int idKey, String value) Inserts the pair (idKey, value) into the stream, then returns the largest possible chunk of currently inserted values that appear next in the order.

	class OrderedStream {
		int ptr;
		Map<Integer,String> map ;
	    public OrderedStream(int n) {
	    	map = new HashMap<Integer,String>(n/3*4+1);
	    	ptr = 1;
	    }
	    
	    public List<String> insert(int idKey, String value) {
	    	map.put(idKey, value);
	    	List<String> list = new ArrayList<String>();
	    	while(map.containsKey(ptr)) {
	    		list.add(map.get(ptr++));
	    	}
	    	return list;
	    }
    }