剑指 Offer 51. 数组中的逆序对 #190
剑指 Offer 51. 数组中的逆序对
#190
giscus[bot]
bot
Replies: 1 comment 2 replies
-
|
归并排序的merge过程，如果left最后有剩余，应该继续累积逆序对 |
Beta Was this translation helpful? Give feedback.
2 replies
-
|
并不需要，因为它算的时候已经考虑到了 |
Beta Was this translation helpful? Give feedback.
-
|
让我再考虑一下 |
Beta Was this translation helpful? Give feedback.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
剑指 Offer 51. 数组中的逆序对
剑指 Offer 51. 数组中的逆序对 标签：树状数组、线段树、数组、二分查找、分治、有序集合、归并排序 难度：困难 题目链接 剑指 Offer 51. 数组中的逆序对 - 力扣 题目大意 描述：给定一个数组 nums。 要求：计算出数组中的逆序对的总数。 说明： 逆序对：在数组中的两个数字，如果前面一个数字大于后面的数字，则这两个数字组成一个逆序对...
https://algo.itcharge.cn/Solutions/Offer/shu-zu-zhong-de-ni-xu-dui-lcof/
Beta Was this translation helpful? Give feedback.
All reactions