NumberOfDiscIntersections--重点

最新推荐文章于 2021-04-11 04:52:58 发布

xyqzki

最新推荐文章于 2021-04-11 04:52:58 发布

阅读量2.8k

点赞数

分类专栏： codelity

本文链接：https://blog.csdn.net/xyqzki/article/details/50068649

版权

这篇博客探讨了如何解决求解N个圆盘相交对数的问题，通过将圆盘转化为1D区间并排序，然后使用二分查找计算每个圆盘与后续圆盘的相交对数。在O(N*log(N))的时间复杂度内实现解决方案。

摘要由CSDN通过智能技术生成

Problem:
We draw N discs on a plane. The discs are numbered from 0 to N − 1. A zero-indexed array A of N non-negative integers, specifying the radiuses of the discs, is given. The J-th disc is drawn with its center at (J, 0) and radius A[J].

We say that the J-th disc and K-th disc intersect if J ≠ K and the J-th and K-th discs have at least one common point (assuming that the discs contain their borders).

The figure below shows discs drawn for N = 6 and A as follows:

A[0] = 1
A[1] = 5
A[2] = 2
A[3] = 1
A[4] = 4
A[5] = 0

There are eleven (unordered) pairs of discs that intersect, namely:

discs 1 and 4 intersect, and both intersect with all the other discs;
disc 2 also intersects with discs 0 and 3.
Write a function:

class Solution { public int solution(int[] A); }

that, given an array A describing N discs as explained above, returns the number of (unordered) pairs of intersecting discs. The function should return −1 if the number of intersecting pairs exceeds 10,000,000.

Given array A shown above, the function should return 11, as explained above.

Assume that:

N is an integer within the range [0..100,000];
each element of array A is an integer within the range [0..2,147,483,647].
Complexity:

expected worst-case time complexity is O(N*log(N));
expected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments).
Elements of input arrays can be modified.

解答：