作者Kuba4ma ()
看板Python
标题[问题] leetcode 1287
时间Thu Apr 23 22:55:17 2020
题目:
Given an integer array sorted in non-decreasing order, there is exactly one
integer in the array that occurs more than 25% of the time.
Return that integer.
Example 1:
Input: arr = [1,2,2,6,6,6,6,7,10]
Output: 6
Constraints:
1 <= arr.length <= 10^4
0 <= arr[i] <= 10^5
code:
class Solution(object):
def findSpecialInteger(self, arr):
"""
:type arr: List[int]
:rtype: int
"""
dic={}
dic=Counter(arr)
for i in dic:
if (dic[i]/len(arr))>0.25:
return i
问题:
我用Visual Studio Code的编译器跑出来没问题，但leetcode会跑出None，不知道
哪里出问题了
--
※ 发信站: 批踢踢实业坊(ptt.cc), 来自: 49.216.60.243 (台湾)
※ 文章网址: https://webptt.com/cn.aspx?n=bbs/Python/M.1587653719.A.314.html
1F：推 cuteSquirrel: dic[i] * 1.0 / len(arr) 就可以了 04/23 23:29
2F：→ cuteSquirrel: Python 2.X 的 / 假如没有转浮点数，预设是整数除法 04/23 23:32
3F：推 mirror0227: 同楼上，Python哪一版要搞清楚 04/23 23:42
4F：推 moodoa3583: 既然都用Counter了怎麽不取most_commons就好，题目说 04/24 00:27
5F：→ moodoa3583: 只会有一个解 04/24 00:27
6F：→ Jyery: 同楼上 用most_commons解 04/29 21:46