<p>使用具有<a href="https://docs.python.org/2/library/collections.html#collections.Counter.most_common" rel="nofollow noreferrer">most_common</a>函数的<a href="https://docs.python.org/2/library/collections.html#collections.Counter" rel="nofollow noreferrer">collections.Counter</a>。在</p>
<pre><code>import collections
def findInt(array):
c = collections.Counter(array)
return c.most_common(1)
</code></pre>
<p><strong>演示</strong></p>
^{pr2}$
<p><em>医生</em></p>
<blockquote>
<p><strong>class collections.Counter([iterable-or-mapping])</strong><br/>
A Counter is a dict subclass for counting hashable objects. It is an unordered collection where elements are stored as dictionary keys and their counts are stored as dictionary values. Counts are allowed to be any integer value including zero or negative counts. The Counter class is similar to bags or multisets in other languages.</p>
<p><strong>most_common([n])</strong><br/>
Return a list of the n most common elements and their counts from the most common to the least. If n is omitted or None, most_common() returns all elements in the counter. Elements with equal counts are ordered arbitrarily:</p>
</blockquote>