fork download 
  1. def longest_chain(lst):
  2.     if not lst:
  3.         return None
  4.  
  5.     curr = lst[0]
  6.     count = 1
  7.     prev = count
  8.     max_num = curr
  9.  
  10.     for number in lst[1:]:
  11.         if number != curr:
  12.             if count > prev:
  13.                 max_num, prev = curr, count
  14.             curr = number
  15.             count = 1
  16.         else:
  17.             count += 1
  18.  
  19.     if count > prev:
  20.         max_num, prev = curr, count
  21.  
  22.     return max_num, prev
  23.  
  24. print(longest_chain([6, 1, 6, 4, 4, 4, 6, 6]))
  25. print(longest_chain([1, 1, 1, 2, 2, 2, 2, 1, 1, 1]))
  26. print(longest_chain([1, 2, 2, 2, 1, 1, 1, 1]))
  27. print(longest_chain([]))
  28.  
Success #stdin #stdout 0.04s 9296KB
comments (?)
stdin 
Standard input is empty
stdout 
(4, 3)
(2, 4)
(1, 4)
None
https://ideone.com/Mfn82g
language:
Python 3 (python  3.12)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!