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

Subscribe to see which companies asked this question.

题解：要求创建一个新数列，对应每一个元素右边的元素中小于它的数的个数。作一个循环，从左往右依次选取一个元素与其右边的元素比较并对小于它的数计数。

1. class Solution {  
2. public:  
3.     vector<int> countSmaller(vector<int>& nums) {  
4.         vector<int> counts(nums.size());  
5.         for(int i=0; i<nums.size(); i++){  
6.             int num=0;  
7.             for(int j=i+1; j<nums.size(); j++){  
8.                 if( nums[j] < nums[i] ) num++;  
9.             }  
10.             counts[i]=num;  
11.         }          
12.         return counts;  
13.     }  
14. };