xutian_curry的博客

点击打开链接对于升序序列来说iterator lower_bound( const key_type &key ): 返回一个迭代器，指向键值>= key的第一个元素。 iterator upper_bound( const key_type &key ):返回一个迭代器，指向键值<=key的最后一个元素的后一个元素。 ...

#include <set>#include <algorithm>using namespace std;class Solution{public: vector<vector<int>> fourSum(vector<int>& nums, int target) { if(nums...

#include <set>#include <algorithm>#include <string>#include <string.h>using namespace std;class Solution{public: bool isValidSudoku(vector<vector<char>>&...

#include <set>class Solution {public: bool containsNearbyDuplicate(vector<int>& nums, int k) { unordered_set<int> record; for( int i = 0; i < nums.s...

维护一个平衡二叉树#include <stdio.h>#include <iostream>#include <stack>#include <string>#include <set>using namespace std;struct Guest{ int P,K; Guest( int pp = 0, ...

注意：因为账单金额有可能重复，所以需要使用multiset，另外结果会爆int#include <stdio.h>#include <iostream>#include <stack>#include <string>#include <set>#include <memory.h>using namespace ...