Abstract Classes - Polymorphism C++
Problem Statement :
Abstract base classes in C++ can only be used as base classes. Thus, they are allowed to have virtual member functions without definitions. A cache is a component that stores data so future requests for that data can be served faster. The data stored in a cache might be the results of an earlier computation, or the duplicates of data stored elsewhere. A cache hit occurs when the requested data can be found in a cache, while a cache miss occurs when it cannot. Cache hits are served by reading data from the cache which is faster than recomputing a result or reading from a slower data store. Thus, the more requests that can be served from the cache, the faster the system performs. One of the popular cache replacement policies is: "least recently used" (LRU). It discards the least recently used items first. For example, if a cache with a capacity to store 5 keys has the following state(arranged from most recently used key to least recently used key) - 5 3 2 1 4 Now, If the next key comes as 1(which is a cache hit), then the cache state in the same order will be - 1 5 3 2 4 Now, If the next key comes as 6(which is a cache miss), then the cache state in the same order will be - 6 1 5 3 2 You can observe that 4 has been discarded because it was the least recently used key and since the capacity of cache is 5, it could not be retained in the cache any longer. Given an abstract base class Cache with member variables and functions: mp - Map the key to the node in the linked list cp - Capacity tail - Double linked list tail pointer head - Double linked list head pointer set() - Set/insert the value of the key, if present, otherwise add the key as the most recently used key. If the cache has reached its capacity, it should replace the least recently used key with a new key. get() - Get the value (will always be positive) of the key if the key exists in the cache, otherwise return -1. You have to write a class LRUCache which extends the class Cache and uses the member functions and variables to implement an LRU cache. Input Format First line of input will contain the N number of lines containing get or set commands followed by the capacity of the cache. The following N lines can either contain get or set commands. An input line starting with get will be followed by a key to be found in the cache. An input line starting with will be followed by the key and value respectively to be inserted/replaced in the cache. Constraints 1 <= N <= 500000 1 <= M <= 1000 1 <= key <= 20 1 <= value <= 2000 Output Format The code provided in the editor will use your derived class LRUCache to output the value whenever a get command is encountered.
Solution :
Solution in C :
class LRUCache : public Cache {
public:
LRUCache(size_t capacity)
{
cp = capacity;
tail = 0;
head = 0;
}
~LRUCache() {
while(tail) {
auto node = tail;
tail = tail->prev;
delete node;
}
}
// Set/insert the value off the key, if present, otherwise
// add the key as the most recently used key. If the cache
// has reached its capacity, it should replace the least
// recently used key with a new key.
void set(int key, int value) {
Node* node;
auto it = mp.find(key);
if(mp.end() == it) {
if(mp.size() < cp) {
node = new Node(key, value);
if(tail) {
tail->next = node;
node->prev = tail;
} else {
tail = node;
head = node;
}
} else {
node = tail;
mp.erase(tail->value);
}
mp.insert(make_pair(key, node));
} else {
node = it->second;
}
node->key = key;
node->value = value;
set_mru(node);
}
// Get the value (will always be positive) of the key
// if the key exists in the cache and then make that key
// as the most recently used key; otherwise, return -1.
int get(int key) {
auto it = mp.find(key);
if(mp.end() == it)
return -1;
auto node = it->second;
set_mru(node);
return node->value;
}
private:
void set_mru(Node* node) {
if(node->next) {
node->next->prev = node->prev;
}
if(node->prev) {
node->prev->next = node->next;
}
if(tail == node)
tail = node->prev;
node->prev = 0;
node->next = head;
head = node;
}
};
View More Similar Problems
Fibonacci Numbers Tree
Shashank loves trees and math. He has a rooted tree, T , consisting of N nodes uniquely labeled with integers in the inclusive range [1 , N ]. The node labeled as 1 is the root node of tree , and each node in is associated with some positive integer value (all values are initially ). Let's define Fk as the Kth Fibonacci number. Shashank wants to perform 22 types of operations over his tree, T
View Solution →Pair Sums
Given an array, we define its value to be the value obtained by following these instructions: Write down all pairs of numbers from this array. Compute the product of each pair. Find the sum of all the products. For example, for a given array, for a given array [7,2 ,-1 ,2 ] Note that ( 7 , 2 ) is listed twice, one for each occurrence of 2. Given an array of integers, find the largest v
View Solution →Lazy White Falcon
White Falcon just solved the data structure problem below using heavy-light decomposition. Can you help her find a new solution that doesn't require implementing any fancy techniques? There are 2 types of query operations that can be performed on a tree: 1 u x: Assign x as the value of node u. 2 u v: Print the sum of the node values in the unique path from node u to node v. Given a tree wi
View Solution →Ticket to Ride
Simon received the board game Ticket to Ride as a birthday present. After playing it with his friends, he decides to come up with a strategy for the game. There are n cities on the map and n - 1 road plans. Each road plan consists of the following: Two cities which can be directly connected by a road. The length of the proposed road. The entire road plan is designed in such a way that if o
View Solution →Heavy Light White Falcon
Our lazy white falcon finally decided to learn heavy-light decomposition. Her teacher gave an assignment for her to practice this new technique. Please help her by solving this problem. You are given a tree with N nodes and each node's value is initially 0. The problem asks you to operate the following two types of queries: "1 u x" assign x to the value of the node . "2 u v" print the maxim
View Solution →Number Game on a Tree
Andy and Lily love playing games with numbers and trees. Today they have a tree consisting of n nodes and n -1 edges. Each edge i has an integer weight, wi. Before the game starts, Andy chooses an unordered pair of distinct nodes, ( u , v ), and uses all the edge weights present on the unique path from node u to node v to construct a list of numbers. For example, in the diagram below, Andy
View Solution →