{"push_id":1479497648,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"dcf60748aad38d72c367bbefdb34c078ca275857","before":"accc9fbace5e982639f3a33315b77958edd6934d","commits":[{"sha":"dcf60748aad38d72c367bbefdb34c078ca275857","author":{"name":"Deen Ma","email":"d692359b8c2dae21e92a9a8280ba9ba96c078656@gmail.com"},"message":"146\nLRU: data structure: we need to use a doubly linked list (so that we can\nfind its previous node) and hashmap (for 0(1) search)\nnote that for the field of doubly linked list, we need to store both key\nand value, otherwise it will be hard to remove the tail in the hashmap","distinct":true,"url":"https://api.github.com/repos/DeenMa/LeetCode/commits/dcf60748aad38d72c367bbefdb34c078ca275857"}]}
{"actor":{"display_login":"DeenMa"}}