似曾相识燕归来的博客

一文说尽“二分查找”本文总结了二分查找算法及其变种。查找指定大小的值（无重复）int BinarySearch::binary_search_unique(std::vector<int> v, int target) { int low = 0; int high = v.size() - 1; int middle; while (low <= hig...

LRU 实现的四种方式单链表class LRUCache {private: struct Node { int key; int val; Node *next; Node(int key, int val) : key(key), val(val), next(nullptr) {} };private...