-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcheck_ans.py
More file actions
35 lines (31 loc) · 834 Bytes
/
check_ans.py
File metadata and controls
35 lines (31 loc) · 834 Bytes
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
#check_ans.py
#check how many ans is wrong.
#way 1:
def check(answer,wenwen):
n=0
for i in range(len(answer)):
if(answer[i]!=wenwen[i]):
n+=1
return n
#driver code
print("way1")
answer = ['A', 'B', 'B', 'E', 'D', 'C']
wenwen = ['B', 'B', 'B', 'E', 'A', 'C']
print(check(answer,wenwen))
#way 2:
def check(answer,wenwen):
l=([1 for i in range(len(answer)) if answer[i]!=wenwen[i]])
return len(l)
#driver code
print("way2")
answer = ['A', 'B', 'B', 'E', 'D', 'C']
wenwen = ['B', 'B', 'B', 'E', 'A', 'C']
print(check(answer,wenwen))
#way 3:
def check(answer, wenwen):
return len([1 for x, y in zip(answer, wenwen) if x != y])
#driver code
print("way3")
answer = ['A', 'B', 'B', 'E', 'D', 'C']
wenwen = ['B', 'B', 'B', 'E', 'A', 'C']
print(check(answer,wenwen))