【一道算法题】寻找N个数中重复数量大于 N/2的数

汐雪池间

于 2017-12-28 22:48:31 发布

阅读量1.6k

点赞数

CC 4.0 BY-SA版权

本文链接：https://blog.csdn.net/landstream/article/details/78927269

这篇博客探讨了一道关于欺诈检测的算法问题，银行怀疑某些银行卡涉及欺诈并没收了n张。问题在于如何确定是否存在一组超过n/2的等效银行卡。文章提到，可以使用等效测试器来判断两张卡是否等效，但需要设计一个O(n log n)复杂度的解决方案。作者对线性复杂度的解法表示出浓厚兴趣，并分享了算法设计的思路，即通过碰撞消除不同银行卡，保留重复次数最多的卡片。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Question

Suppose you’re consulting for a bank that’s concerned about fraud detection, and they come to you with the following problem. They have a collection of n bank cards that they’ve confiscated, suspecting them of being used in fraud. Each bank card is a small plastic object, containing a magnetic stripe with some encrypted data, and it corresponds to a unique account in the bank. Each account can have many bank cards corresponding to it, and we’ll say that two bank cards are equivalent if
they correspond to the same account. It’s very difficult to read the account number off a bank card directly,
but the bank has a high-tech “equivalence tester” that takes two bank cards and, after performing some computations, determines whether they are equivalent.
Their question is the following: among the collection of n cards, is there a set of more than n/2 of them that are all equivalent to one another?

Assume that the only