编程练习（第二周）

315. Count of Smaller Numbers After Self（题目网址来源：https://leetcode.com）

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

Subscribe to see which companies asked this question.

题解：简单来说，题目要求创建一个新数列，对应每一个元素右边的元素中小于它的数的个数。所以，我直观的思想就是作一个循环，从左往右依次选取一个元素与其右边的元素比较并对小于它的数计数。虽然题目类型属于分治算法，但是我想了半天也没搞懂如何对这道题使用，望大神们轻喷。

代码如下：

class Solution {
public:
    vector<int> countSmaller(vector<int>& nums) {
        vector<int> counts(nums.size());
	    for(int i=0; i<nums.size(); i++){
	    	int num=0;
	    	for(int j=i+1; j<nums.size(); j++){
	    		if( nums[j] < nums[i] ) num++;
    		}
	    	counts[i]=num;
	    }        
    	return counts;
    }
};