liuchenjane的博客

Design and implement a data structure for Least Frequently Used (LFU) cache. It should support the following operations: get and put. get(key) - Get the value (will always be positive) of the key

Design a data structure that supports all following operations in average O(1) time. insert(val): Inserts an item val to the set if not already present.remove(val): Removes an item val from the

Design a data structure that supports all following operations in average O(1) time. Note: Duplicate elements are allowed. insert(val): Inserts an item val to the collection.remove(val): Remov

//一个自建的MyString类 #include <iostream> #include <cstring> using namespace std; class String{ private: char * str; int len; static int num_strings;//number of objects; publ