315. Count of Smaller Numbers After Self

You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of nums[i].

Example:

Given nums = [5, 2, 6, 1]

To the right of 5 there are 2 smaller elements (2 and 1).
To the right of 2 there is only 1 smaller element (1).
To the right of 6 there is 1 smaller element (1).
To the right of 1 there is 0 smaller element.

Return the array [2, 1, 1, 0].

解题思路：构建二叉搜索树，从数组的右边开始向二叉树中插入元素，每插入一个元素，如果插入到二叉树结点的左子树，更新其父节点统计的左子节点个数；如果插入到二叉树结点的右子树，那么插入的节点的左子树个数为当前节点的左子树+1（1表示算上当前的节点）。

struct BSTNode
{
    BSTNode(int val):val(val), count(0), left(NULL), right(NULL){}
    
    int val;
    int count;  // 左子节点个数
    BSTNode *left;
    BSTNode *right;
};

// count = 比node小的节点数量
void Insert(BSTNode *root, BSTNode *node, int &count)
{
    if(root->val >= node->val)
    {
        ++root->count;
        if(!root->left)
            root->left = node;
        else
            Insert(root->left, node, count);
    }
    else
    {
        count += root->count + 1;
        if(!root->right)
            root->right = node;
        else
            Insert(root->right, node, count);
    }
}

class Solution {
public:
    vector<int> countSmaller(vector<int>& nums) {
        vector<int> res;
        vector<BSTNode *> node_vec;
        for(int i = nums.size() - 1; i >= 0; --i)
        {
            node_vec.push_back(new BSTNode(nums[i]));
        }
       
        vector<int> cnt;
        cnt.push_back(0);
        for(int i = 1; i < node_vec.size(); ++i)
        {
            int count = 0;
            Insert(node_vec[0], node_vec[i], count);
            cnt.push_back(count);
        }
         
        for(int i = node_vec.size() - 1; i >= 0; --i)
        {
            delete node_vec[i];
            res.push_back(cnt[i]);
        }
        
        return res;
    }
};