-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathHow_many.py
52 lines (41 loc) · 1.16 KB
/
How_many.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
# def solution(array):
# answer = 0
# count = 0
# for i in range(len(array)):
# for z in range(1001):
# if array[i] == array[z]:
# answer += 1
# print(answer)
# solution([1, 2, 3, 3, 3, 4])
# def solution(array):
# answer = 0
# for i, answers in enumerate(array):
# # print(i, answers)
# for z in range(1000):
# if answers == z:
# answer += 1
# print(answer)
# solution([1, 2, 3, 3, 3, 4])
# def solution(array):
# answer = 0
# answers = []
# count = 0
# for z in range(1000):
# for i, answer in enumerate(array):
# if z == answer:
# count += 1
# answers.append(answer)
# print(count)
# solution([1, 2, 3, 3, 3, 4])
# def solution(array):
# answer = 0
# for i in array:
# print(i)
# solution([1, 2, 3, 3, 3, 4])
def solution(array):
nlist = [0 for i in range(100)]
for i in range(len(array)):
print(array)
nlist[list[i]] += 1
print(nlist.index(max(nlist)+ 1))
solution([1, 2, 3, 3, 3, 4])