leetcode第311场周赛

LeetCode 2413. 最小偶倍数

class Solution {
public:
    int smallestEvenMultiple(int n) {
       return 2*n/gcd(2,n); 
    }
};

LeetCode 2414. 最长的字母序连续子字符串的长度

class Solution {
public:
    int longestContinuousSubstring(string s) {
        int res=1;
        int n=s.size();
        for(int i=0,j=0;i<n;i++)
        {
            j=i;
            while(j<n-1&&s[j]+1==s[j+1])j++;
            res=max(res,j-i+1);
            i=j;
        }
        return res;
    }
};

LeetCode 2415. 反转二叉树的奇数层

/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode() : val(0), left(nullptr), right(nullptr) {}
 *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
 *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
 * };
 */
class Solution {
public:
    void bfs(TreeNode*root)
    {
        queue<TreeNode*>q;
        q.push(root);
        int f=0;
        int cnt=0;
        while(q.size())
        {
            int sz=q.size();
            vector<TreeNode*>v;
            vector<int>v2;
            for(int i=0;i<sz;i++)
            {
                auto t=q.front();
                q.pop();
                if(t->left)q.push(t->left);
                if(t->right)q.push(t->right);
                v.push_back(t);
                v2.push_back(t->val);
            }
            if(cnt%2)reverse(v2.begin(),v2.end());
            for(int i=0;i<sz;i++)
                v[i]->val=v2[i];
            cnt++;
        }
    }
    TreeNode* reverseOddLevels(TreeNode* root) {
        bfs(root);
        return root;
    }
};

LeetCode 2416. 字符串的前缀分数和

const int N=5e5+10;
class Solution {
public:
    int tr[N][26];
    int cnt[N];
    int idx=0;
    void insert(string s)
    {
        int p=0;
        for(int i=0;i<s.size();i++)
        {
            int u=s[i]-'a';
            if(!tr[p][u])tr[p][u]=++idx;
            p=tr[p][u];
            cnt[p]++;
        }
    }
    int query(string s)
    {
        int p=0;
        int res=0;
        for(int i=0;i<s.size();i++)
        {
            int t=s[i]-'a';
            p=tr[p][t];
            res+=cnt[p];
        }
        return res;
    }
    vector<int> sumPrefixScores(vector<string>& words) {
        vector<int>v;
        memset(tr,0,sizeof tr);
        memset(cnt,0,sizeof cnt);
        for(int i=0;i<words.size();i++)
            insert(words[i]);
        for(int i=0;i<words.size();i++)
            v.push_back(query(words[i]));
        return v;
    }
};