五月集训，day16 不会做了，做别的去

day20
BST

struct TreeNode* searchBST(struct TreeNode* root, int val){
    while (root != NULL)
    {
        if (val < root -> val)
            root = root -> left;
        else if (val > root -> val)
            root = root -> right;
        else return root;
    }
    return NULL;
}

217

int cmp (const void* a, const void* b)
{
    return *(int *)a - *(int *)b;
}
bool containsDuplicate(int* nums, int numsSize){
    qsort(nums,numsSize,sizeof(int),cmp);
    for(int i = 0; i < numsSize - 1; ++i)
        if(nums[i] == nums[i + 1])
            return true;
    return false;
}

53

int maxSubArray(int* nums, int numsSize){
    int ans = nums[0], p = 0;
    for(int i = 0; i < numsSize; ++i)
    {
        if(p + nums[i] > nums[i])
            p += nums[i];
        else p = nums[i];
        if(p > ans)
            ans = p;
    }
    return ans;
}