摘要：
link class Solution { public: int fa[10001]; vector<bool> areConnected(int n, int threshold, vector<vector<int>>& queries) { for(int i=1;i<=n;i++) fa[ 阅读全文
摘要：
link select * from patients where conditions REGEXP BINARY '^DIAB1|\\sDIAB1' select * from patients where conditions like BINARY 'DIAB1%' or condition 阅读全文
摘要：
link select * from users where mail regexp '^[a-zA-Z][a-zA-Z0-9_/\\.\\-]*(@leetcode.com)' 阅读全文
摘要：
https://leetcode-cn.com/problems/Za25hA/ 阅读全文
摘要：
link select name as country from ( select name,sum(duration)/count(duration) as avg from ( select t.name,t.id, c1.caller_id, c1.callee_id, c1.duration 阅读全文
摘要：
link select sell_date, count(distinct product) as num_sold, group_concat(distinct product order by product asc separator ',') as products from activit 阅读全文
摘要：
link select i.item_category as category, sum(if(date_format(order_date,'%W')='Monday',quantity,0)) as 'Monday', sum(if(date_format(order_date,'%W')='T 阅读全文
摘要：
link class Solution { public: #define LL long long unordered_map<int,LL> memo; int busRapidTransit(int target, int inc, int dec, vector<int>& jump, ve 阅读全文
摘要：
link class Solution { public: bool isTransformable(string s, string t) { vector<deque<int>> pos(10); for(int i=0;i<s.size();i++){ pos[s[i]-'0'].push_b 阅读全文
摘要：
link class Solution { public: #define LL long long const int mod=1E9+7; vector<vector<LL>> table; int numOfWays(vector<int>& nums) { int n=nums.size() 阅读全文