LeetCode - 第209场周赛

国庆放假，赛后补题.

A. 特殊数组的特征值

简单模拟.

class Solution {
public:
    int specialArray(vector<int>& nums) {
        sort(nums.begin(),nums.end());
        int n=nums.size();
        for(int i=0;i<=n;++i){
            int j=0;
            while(j<n && nums[j]<i) ++j;
            if(i==n-j) return i;
        }
        return -1;
    }
};

B. 奇偶树

BFS.

/**
 * 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:
    bool isEvenOddTree(TreeNode* root) {
        if(!root) return true;
        queue<TreeNode*> que;
        que.push(root);
        bool even=true;
        while(!que.empty()){
            int sz=que.size();
            vector<int> v;
            for(int i=0;i<sz;++i){
                TreeNode* cur=que.front();que.pop();
                v.push_back(cur->val);
                if(cur->left) que.push(cur->left);