算法题--（i & -i）的特性（Leetcode No.315）_i += i & -i

作者：我家小花儿 | 2024-03-13 03:58:47

踩

i += i & -i

最近在leetcode上做了一道题(No.315)，查看一份耗时较少的代码时，发现其思路与其他的做法不同，没有采用“分治”的思想，但同样达到了较高的效率。

题目：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

声明：本文内容由网友自发贡献，不代表【wpsshop博客】立场，版权归原作者所有，本站不承担相应法律责任。如您发现有侵权的内容，请联系我们。转载请注明出处：https://www.wpsshop.cn/w/我家小花儿/article/detail/227650