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].

JAVA代码：

public class Solution {
    class node{
node left,right;
int val,sum,dup=1;
node(int val,int sum){
this.val=val;
this.sum=sum;
}
}

public List<Integer> countSmaller(int[] nums) {
        Integer[] res=new Integer[nums.length];
        node root=null;
        for(int i=nums.length-1;i>=0;i--)
        root=insert(nums,res,root,i,0);
        return Arrays.asList(res);
    }

public node insert(int[] nums,Integer[] res,node root,int i,int precnt){
if(root==null){
res[i]=precnt;
return new node(nums[i],0);
}else{
if(nums[i]==root.val){
root.dup++;
res[i]=precnt+root.sum;
}else if(nums[i]<root.val){
root.sum++;
root.left=insert(nums,res,root.left,i,precnt);
}else{
root.right=insert(nums,res,root.right,i,precnt+root.dup+root.sum);
}
}
return root;
}
}

时间复杂度：O(n*log(n))