map uses a red-black tree as the data structure, so the elements you put in there are sorted, and insert/delete is O(log(n)).
確定! 回上一頁