首页 > 编程语言 > 详细

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

时间:2021-09-01 13:19:16      阅读:24      评论:0      收藏:0      [点我收藏+]

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

原文:https://www.cnblogs.com/immiao0319/p/15208610.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!