STL
齐豪
...
展开
-
POJ_3061
Subsequence Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12751 Accepted: 5389 Description A sequence of N positive integers (10 < N < 100 000), each o原创 2016-10-16 16:48:24 · 427 阅读 · 0 评论 -
POJ_3320
Jessica's Reading Problem Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10966 Accepted: 3692 Description Jessica's a very lovely girl wooed by lots of原创 2016-10-16 22:19:24 · 211 阅读 · 0 评论 -
STL中的二分查找——lower_bound 、upper_bound 、binary_search
原文地址:http://blog.csdn.net/sicofield/article/details/8740141 二分查找很简单,原理就不说了。STL中关于二分查找的函数有三个lower_bound 、upper_bound 、binary_search 。这三个函数都运用于有序区间(当然这也是运用二分查找的前提)。 其中如果寻找的value存在,那么lower_b原创 2016-10-16 16:36:24 · 499 阅读 · 0 评论 -
[leetcode] 295. Find Median from Data Stream
https://leetcode.com/problems/find-median-from-data-stream/solution/ class MedianFinder { priority_queue<int> lo; // max heap priority_queue<int, vector<int>, great原创 2017-10-23 11:26:13 · 424 阅读 · 0 评论 -
[leetcode] 146. LRU Cache
https://leetcode.com/problems/lru-cache/description/ class LRUCache { private: int _capacity; list<pair<int, int> > _list; unordered_map<int, list<pair<int, int> >::iterator> _map; public:原创 2017-10-23 18:03:13 · 212 阅读 · 0 评论