[LeetCode 1356~1359][周赛]双周赛20题解

1356. 根据数字二进制下 1 的数目排序

题目链接

static const auto io_speed_up = [](){
    ios::sync_with_stdio(false);
    cin.tie(0);
    return 0;
}();
class Solution {
public:
    int cnt[10010];
    vector<int> sortByBits(vector<int>& arr) {
        for(auto p : arr)cnt[p] = __builtin_popcount(p);
        sort(arr.begin(), arr.end(), [&](int a,int b){return cnt[a]==cnt[b]?a<b:cnt[a]<cnt[b];});
        return arr;
    }
};

1357. 每隔 n 个顾客打折

题目链接

static const auto io_speed_up = [](){
    ios::sync_with_stdio(false);
    cin.tie(0);
    return 0;
}();
class Cashier {
public:
    int fn , p = 0;
    int mp[205];
    double dc;
    Cashier(int n, int discount, vector<int>& products, vector<int>& prices) {
        fn = n;dc = (100.0 - discount)/100;
        n = products.size();
        for(int i = 0;i<n;i++){
            mp[products[i]]=prices[i];
        }
    }
    
    double getBill(vector<int> product, vector<int> amount) {
        double ans = 0;
        int n = product.size();
        for(int i = 0;i<n;i++){
            ans += (amount[i] * mp[product[i]]);
        }
        p++;
        if(p == fn){p = 0;return ans * dc;}
        else return ans;
    }
};

/**
 * Your Cashier object will be instantiated and called as such:
 * Cashier* obj = new Cashier(n, discount, products, prices);
 * double param_1 = obj->getBill(product,amount);
 */

1358. 包含所有三种字符的子字符串数目

题目链接

static const auto io_speed_up = [](){
    ios::sync_with_stdio(false);
    cin.tie(0);
    return 0;
}();
typedef long long LL;
class Solution {
public:
    int cnt[3]={0};
    int numberOfSubstrings(string s) {
        int len = s.size();
        LL ans = 0;
        int l = 0, r = -1;
        int is = 0;
        while(l<len){
            if(is==3){
                ans += (len - r);
                cnt[s[l]-'a']--;
                if(!cnt[s[l++]-'a'])is--;
            }
            else {
                if(++r==len)break;
                if(!(cnt[s[r]-'a']++))is++;
            }
        }
        return ans;
    }
};

1359. 有效的快递序列数目

题目链接

class Solution {
public:
    typedef long long LL;
    const LL mod = 1e9 + 7;
    int countOrders(int n) {
        LL p = 1;
        for(int i = 1;i<n;i++){
           p =  (LL)(i*2+1)* (i + 1)%mod * p %mod;
        }
        return p;
    }
};