i-Blue的专栏

参考： https://www.byvoid.com/blog/binary-index-tree http://www.cnblogs.com/sixdaycoder/p/4348360.html http://blog.youkuaiyun.com/liangzhaoyang1/article/details/51365192 1）求Ci C[i] = A[i-2^k+1]

Tags--binary indexed tree(二分索引树，树状数组）

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: