Guest User

Untitled

a guest
Dec 14th, 2018
66
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.61 KB | None | 0 0
  1. def solution(A):
  2. num_dict = {}
  3. length = len(A)
  4. for idx, key in enumerate(A):
  5. cnt_li = num_dict.get(key)
  6. if cnt_li:
  7. cnt_li.append(idx)
  8. num_dict[key] = cnt_li
  9. else:
  10. num_dict[key] = [idx]
  11.  
  12. max_key = sorted(num_dict, key=lambda x: len(num_dict[x]), reverse=True)[0]
  13. max_li = num_dict.get(max_key)
  14. if len(max_li) > (length // 2):
  15. return max_li[0]
  16. else:
  17. return -1
  18.  
  19. A = [3, 4, 3, 2, 3, -1, 3, 3]
  20. print(solution(A))
  21.  
  22. A = [3, 4, 2, 2, -1, -1, -1, 3]
  23. print(solution(A))
  24.  
  25. A = [3, 2, 2, 2, 3, 2, 3, 3, 2, 2]
  26. print(solution(A))
Add Comment
Please, Sign In to add comment