C/C++教程

315. Count of Smaller Numbers After Self 数组比自己小的元素个数，不能for要用bst

本文主要是介绍315. Count of Smaller Numbers After Self 数组比自己小的元素个数，不能for要用bst，对大家解决编程问题具有一定的参考价值，需要的程序猿们随着小编来一起学习吧！

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 1:

Input: nums = [5,2,6,1]
Output: [2,1,1,0]
Explanation:
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.

Example 2:

Input: nums = [-1]
Output: [0]

Example 3:

Input: nums = [-1,-1]
Output: [0,0]
这篇关于315. Count of Smaller Numbers After Self 数组比自己小的元素个数，不能for要用bst的文章就介绍到这儿，希望我们推荐的文章对大家有所帮助，也希望大家多多支持为之网！
您可能喜欢
栏目导航