Question

Use the FDR to design and write a function, maxValTimes, that takes a list of integers and returns a set containing the value(s) that occur the same number of times as the maximum value in the list. If the list is empty, return an empty set.  

For example if the list was [2,1,1,2,3,3,1] the function would return {2,3} as the maximum value is 3 which occurs twice, and 2 also occurs twice (but 1 occurs 3 times).

For full marks, please note the following:

Proper indentation and syntax are required.

You may use Python's built in list functions len and count, and set function add.  You may not use any other Python functions.

Answer 1

Code:

def maxValTimes(l):
size=len(l)
max=l[0]
for i in l:
if i>max:
max=i
fmax=l.count(max)
s=set(l)
r=set()
for x in s:
if l.count(x) == fmax:
r.add(x)
return r
  
l=[2,1,1,2,3,3,1]
print(maxValTimes(l))
  

Screenshot:

1, def maxValTimes (1): 2 size-len(1) 3 max=1[@] 4, for i in 1: 5. if i>max: 6 max-i 7 fmax=1.count(max) 8 s=set(1) 9 r=set() 10- for x in s: 11 - if 1.count(x) 12 r.add(x) 13 return r 14 15 1=[2,1,1,2,3,3,1] 16 print(maxValTimes (1) 17 fmax: |