class Solution(object):
def findShortestSubArray(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
max_count=0
max_count_num=[]
for each in set(nums):
count=nums.count(each)
if max_count<=count:
max_count=count
for each in set(nums):
if nums.count(each)==max_count:
max_count_num.append(each)
span=[]
for each_max_d in max_count_num:
start_idx=0
end_idx=0
max_d_num=each_max_d
for idx,each in enumerate(nums):
if each==max_d_num:
start_idx=idx
break
for idx,each in enumerate(nums[::-1]):
if each==max_d_num:
end_idx=len(nums)-idx
break
span.append(end_idx-start_idx)
return min(span)
697. Degree of an Array
最新推荐文章于 2022-04-28 21:25:25 发布