AlgorithmsByPython/Queue.py at master · DouTong/AlgorithmsByPython · GitHub

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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
classQueue:
def__init__(self):
self.items= []

defisEmpty(self):
returnself.items== []

defenqueue(self, item):
self.items.insert(0, item)

defdequeue(self):
returnself.items.pop()

defsize(self):
returnlen(self.items)

q=Queue()
q.enqueue(4)
q.enqueue('god')
q.enqueue(True)
print(q.dequeue())

defhotPotato(namelist, num):
simqueue=Queue()
fornameinnamelist:
simqueue.enqueue(name)

whilesimqueue.size() >1:
foriinrange(num):
simqueue.enqueue(simqueue.dequeue())
simqueue.dequeue()

returnsimqueue.dequeue()

print(hotPotato(["Bill","David","Susan","Jane","Kent","Brad"],7))

# 设计一个良策都能插入删除的队列deque
classDeque:
def__init__(self):
self.items= []

defisEmpty(self):
returnself.items== []

defaddRear(self, item):
self.items.insert(0, item)

defaddFront(self, item):
self.items.append(item)

defremoveFront(self):
returnself.items.pop()

defremoveRear(self):
returnself.items.pop(0)

defsize(self):
returnlen(self.items)

# 利用Deque解决回文字符串
defpalcheker(aString):
chardeque=Deque()

forchinaString:
chardeque.addFront(ch)

stillEqual=True

whilechardeque.size() >1andstillEqual:
first=chardeque.removeFront()
last=chardeque.removeRear()
iffirst!=last:
stillEqual=False

returnstillEqual

print(palcheker('lsdkjfskf'))
print(palcheker('radar'))
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
classQueue:
def__init__(self):
self.items= []

defisEmpty(self):
returnself.items== []

defenqueue(self, item):
self.items.insert(0, item)

defdequeue(self):
returnself.items.pop()

defsize(self):
returnlen(self.items)

q=Queue()
q.enqueue(4)
q.enqueue('god')
q.enqueue(True)
print(q.dequeue())

defhotPotato(namelist, num):
simqueue=Queue()
fornameinnamelist:
simqueue.enqueue(name)

whilesimqueue.size() >1:
foriinrange(num):
simqueue.enqueue(simqueue.dequeue())
simqueue.dequeue()

returnsimqueue.dequeue()

print(hotPotato(["Bill","David","Susan","Jane","Kent","Brad"],7))

# 设计一个良策都能插入删除的队列deque
classDeque:
def__init__(self):
self.items= []

defisEmpty(self):
returnself.items== []

defaddRear(self, item):
self.items.insert(0, item)

defaddFront(self, item):
self.items.append(item)

defremoveFront(self):
returnself.items.pop()

defremoveRear(self):
returnself.items.pop(0)

defsize(self):
returnlen(self.items)

# 利用Deque解决回文字符串
defpalcheker(aString):
chardeque=Deque()

forchinaString:
chardeque.addFront(ch)

stillEqual=True

whilechardeque.size() >1andstillEqual:
first=chardeque.removeFront()
last=chardeque.removeRear()
iffirst!=last:
stillEqual=False

returnstillEqual

print(palcheker('lsdkjfskf'))
print(palcheker('radar'))
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
classQueue:
def__init__(self):
self.items= []

defisEmpty(self):
returnself.items== []

defenqueue(self, item):
self.items.insert(0, item)

defdequeue(self):
returnself.items.pop()

defsize(self):
returnlen(self.items)

q=Queue()
q.enqueue(4)
q.enqueue('god')
q.enqueue(True)
print(q.dequeue())

defhotPotato(namelist, num):
simqueue=Queue()
fornameinnamelist:
simqueue.enqueue(name)

whilesimqueue.size() >1:
foriinrange(num):
simqueue.enqueue(simqueue.dequeue())
simqueue.dequeue()

returnsimqueue.dequeue()

print(hotPotato(["Bill","David","Susan","Jane","Kent","Brad"],7))

# 设计一个良策都能插入删除的队列deque
classDeque:
def__init__(self):
self.items= []

defisEmpty(self):
returnself.items== []

defaddRear(self, item):
self.items.insert(0, item)

defaddFront(self, item):
self.items.append(item)

defremoveFront(self):
returnself.items.pop()

defremoveRear(self):
returnself.items.pop(0)

defsize(self):
returnlen(self.items)

# 利用Deque解决回文字符串
defpalcheker(aString):
chardeque=Deque()

forchinaString:
chardeque.addFront(ch)

stillEqual=True

whilechardeque.size() >1andstillEqual:
first=chardeque.removeFront()
last=chardeque.removeRear()
iffirst!=last:
stillEqual=False

returnstillEqual

print(palcheker('lsdkjfskf'))
print(palcheker('radar'))
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
classQueue:
def__init__(self):
self.items= []

defisEmpty(self):
returnself.items== []

defenqueue(self, item):
self.items.insert(0, item)

defdequeue(self):
returnself.items.pop()

defsize(self):
returnlen(self.items)

q=Queue()
q.enqueue(4)
q.enqueue('god')
q.enqueue(True)
print(q.dequeue())

defhotPotato(namelist, num):
simqueue=Queue()
fornameinnamelist:
simqueue.enqueue(name)

whilesimqueue.size() >1:
foriinrange(num):
simqueue.enqueue(simqueue.dequeue())
simqueue.dequeue()

returnsimqueue.dequeue()

print(hotPotato(["Bill","David","Susan","Jane","Kent","Brad"],7))

# 设计一个良策都能插入删除的队列deque
classDeque:
def__init__(self):
self.items= []

defisEmpty(self):
returnself.items== []

defaddRear(self, item):
self.items.insert(0, item)

defaddFront(self, item):
self.items.append(item)

defremoveFront(self):
returnself.items.pop()

defremoveRear(self):
returnself.items.pop(0)

defsize(self):
returnlen(self.items)

# 利用Deque解决回文字符串
defpalcheker(aString):
chardeque=Deque()

forchinaString:
chardeque.addFront(ch)

stillEqual=True

whilechardeque.size() >1andstillEqual:
first=chardeque.removeFront()
last=chardeque.removeRear()
iffirst!=last:
stillEqual=False

returnstillEqual

print(palcheker('lsdkjfskf'))
print(palcheker('radar'))
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
classQueue:
def__init__(self):
self.items= []

defisEmpty(self):
returnself.items== []

defenqueue(self, item):
self.items.insert(0, item)

defdequeue(self):
returnself.items.pop()

defsize(self):
returnlen(self.items)

q=Queue()
q.enqueue(4)
q.enqueue('god')
q.enqueue(True)
print(q.dequeue())

defhotPotato(namelist, num):
simqueue=Queue()
fornameinnamelist:
simqueue.enqueue(name)

whilesimqueue.size() >1:
foriinrange(num):
simqueue.enqueue(simqueue.dequeue())
simqueue.dequeue()

returnsimqueue.dequeue()

print(hotPotato(["Bill","David","Susan","Jane","Kent","Brad"],7))

# 设计一个良策都能插入删除的队列deque
classDeque:
def__init__(self):
self.items= []

defisEmpty(self):
returnself.items== []

defaddRear(self, item):
self.items.insert(0, item)

defaddFront(self, item):
self.items.append(item)

defremoveFront(self):
returnself.items.pop()

defremoveRear(self):
returnself.items.pop(0)

defsize(self):
returnlen(self.items)

# 利用Deque解决回文字符串
defpalcheker(aString):
chardeque=Deque()

forchinaString:
chardeque.addFront(ch)

stillEqual=True

whilechardeque.size() >1andstillEqual:
first=chardeque.removeFront()
last=chardeque.removeRear()
iffirst!=last:
stillEqual=False

returnstillEqual

print(palcheker('lsdkjfskf'))
print(palcheker('radar'))
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
classQueue:
def__init__(self):
self.items= []

defisEmpty(self):
returnself.items== []

defenqueue(self, item):
self.items.insert(0, item)

defdequeue(self):
returnself.items.pop()

defsize(self):
returnlen(self.items)

q=Queue()
q.enqueue(4)
q.enqueue('god')
q.enqueue(True)
print(q.dequeue())

defhotPotato(namelist, num):
simqueue=Queue()
fornameinnamelist:
simqueue.enqueue(name)

whilesimqueue.size() >1:
foriinrange(num):
simqueue.enqueue(simqueue.dequeue())
simqueue.dequeue()

returnsimqueue.dequeue()

print(hotPotato(["Bill","David","Susan","Jane","Kent","Brad"],7))

# 设计一个良策都能插入删除的队列deque
classDeque:
def__init__(self):
self.items= []

defisEmpty(self):
returnself.items== []

defaddRear(self, item):
self.items.insert(0, item)

defaddFront(self, item):
self.items.append(item)

defremoveFront(self):
returnself.items.pop()

defremoveRear(self):
returnself.items.pop(0)

defsize(self):
returnlen(self.items)

# 利用Deque解决回文字符串
defpalcheker(aString):
chardeque=Deque()

forchinaString:
chardeque.addFront(ch)

stillEqual=True

whilechardeque.size() >1andstillEqual:
first=chardeque.removeFront()
last=chardeque.removeRear()
iffirst!=last:
stillEqual=False

returnstillEqual

print(palcheker('lsdkjfskf'))
print(palcheker('radar'))
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
classQueue:
def__init__(self):
self.items= []

defisEmpty(self):
returnself.items== []

defenqueue(self, item):
self.items.insert(0, item)

defdequeue(self):
returnself.items.pop()

defsize(self):
returnlen(self.items)

q=Queue()
q.enqueue(4)
q.enqueue('god')
q.enqueue(True)
print(q.dequeue())

defhotPotato(namelist, num):
simqueue=Queue()
fornameinnamelist:
simqueue.enqueue(name)

whilesimqueue.size() >1:
foriinrange(num):
simqueue.enqueue(simqueue.dequeue())
simqueue.dequeue()

returnsimqueue.dequeue()

print(hotPotato(["Bill","David","Susan","Jane","Kent","Brad"],7))

# 设计一个良策都能插入删除的队列deque
classDeque:
def__init__(self):
self.items= []

defisEmpty(self):
returnself.items== []

defaddRear(self, item):
self.items.insert(0, item)

defaddFront(self, item):
self.items.append(item)

defremoveFront(self):
returnself.items.pop()

defremoveRear(self):
returnself.items.pop(0)

defsize(self):
returnlen(self.items)

# 利用Deque解决回文字符串
defpalcheker(aString):
chardeque=Deque()

forchinaString:
chardeque.addFront(ch)

stillEqual=True

whilechardeque.size() >1andstillEqual:
first=chardeque.removeFront()
last=chardeque.removeRear()
iffirst!=last:
stillEqual=False

returnstillEqual

print(palcheker('lsdkjfskf'))
print(palcheker('radar'))
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
classQueue:
def__init__(self):
self.items= []

defisEmpty(self):
returnself.items== []

defenqueue(self, item):
self.items.insert(0, item)

defdequeue(self):
returnself.items.pop()

defsize(self):
returnlen(self.items)

q=Queue()
q.enqueue(4)
q.enqueue('god')
q.enqueue(True)
print(q.dequeue())

defhotPotato(namelist, num):
simqueue=Queue()
fornameinnamelist:
simqueue.enqueue(name)

whilesimqueue.size() >1:
foriinrange(num):
simqueue.enqueue(simqueue.dequeue())
simqueue.dequeue()

returnsimqueue.dequeue()

print(hotPotato(["Bill","David","Susan","Jane","Kent","Brad"],7))

# 设计一个良策都能插入删除的队列deque
classDeque:
def__init__(self):
self.items= []

defisEmpty(self):
returnself.items== []

defaddRear(self, item):
self.items.insert(0, item)

defaddFront(self, item):
self.items.append(item)

defremoveFront(self):
returnself.items.pop()

defremoveRear(self):
returnself.items.pop(0)

defsize(self):
returnlen(self.items)

# 利用Deque解决回文字符串
defpalcheker(aString):
chardeque=Deque()

forchinaString:
chardeque.addFront(ch)

stillEqual=True

whilechardeque.size() >1andstillEqual:
first=chardeque.removeFront()
last=chardeque.removeRear()
iffirst!=last:
stillEqual=False

returnstillEqual

print(palcheker('lsdkjfskf'))
print(palcheker('radar'))