-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathD6-1.py
38 lines (32 loc) · 921 Bytes
/
D6-1.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
from collections import deque
# check the count
# use a deque
# add a letter one by one to the deque
# from the fourth, check whether characters are all different
# if the last
# the search stops when all the four letters are different
# increase the count for every append c =+1
# c=0, last_four = deque([])
filename = 'D6-1_input_p.txt'
c = 0
last_four = deque([])
with open(filename, 'r') as fin:
while True:
cha = fin.read(1)
# print(cha)
c += 1
last_four.append(cha)
# print(f"c={c}")
# print(last_four)
if last_four.count == 4:
if len(set(last_four)) ==4:
print(f"c={c}")
print(c)
break
if c > 4:
last_four.popleft()
print(last_four)
if len(set(last_four)) == 4:
print(last_four)
print(c)
break