Skip to content

Instantly share code, notes, and snippets.

@computer-tutor

computer-tutor/Chap9Q5.py

Created April 25, 2020 11:26
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 1 You must be signed in to fork a gist
  • Save computer-tutor/03e5abd004a6569349623dc80a8ad5bd to your computer and use it in GitHub Desktop.
Save computer-tutor/03e5abd004a6569349623dc80a8ad5bd to your computer and use it in GitHub Desktop.
Download ZIP
Raw
Chap9Q5.py
V = [[2, 6], [3, 10], [15], [23], [1, 8, 15, 22, 29], [14]]
def Mvisit(l):
c = 0 #Counter
hv = None # the visits
for i in V:
if len(i) > c: # compares numbers of visits
c = len(i)
hv = i
print("Highest number of visits are :", hv)
Mvisit(V)
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment