LRU Cache update

Author: delmorallopez

Sprint-2/implement_lru_cache/lru_cache.py

@@ -50,7 +50,6 @@ def _add_to_head(self, node):
     def get(self, key):
         if key not in self.cache:
             return None
-
         # Move key to the end (most recently used)
         value = self.cache.pop(key)
         self.cache[key] = value