Repository navigation
Expand file tree
/
Copy pathStacks.py
More file actions
104 lines (74 loc) · 1.86 KB
/
Copy pathStacks.py
File metadata and controls
104 lines (74 loc) · 1.86 KB
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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
import ctypes
"""Stacks using LINKEDLIST!!"""
class Node:
def __init__(self, value):
self.data = value
self.next = None
class Stack:
def __init__(self):
self.top = None
def is_empty(self):
return self.top is None
def push(self, value):
new_node = Node(value)
new_node.next = self.top
self.top = new_node
def peek(self):
if self.is_empty():
return "Stack is empty"
else:
return self.top.data
def pop(self,value):
if self.is_empty():
return "Stack is empty"
else:
data = self.top.data
self.top = self.top.next
return data
def traverse(self):
temp = self.top
while temp is not None:
print(temp.data)
temp = temp.next
def reverse_string(text):
s = Stack()
for i in text:
s.push(i)
result = ""
while not s.is_empty():
result = result + s.pop(text)
return result
def text_editor(text, pattern):
u=Stack()
r=Stack()
for i in text:
u.push(i)
for i in pattern:
if i == "u":
data=u.pop(text)
r.push(data)
else:
data=r.pop(text)
r.push(data)
result = ""
while not u.is_empty():
result = u.pop(text) + result
return result
"""Stacks using ARRAYS!!"""
class stack:
def __init__(self, size):
self.size = size
self.stack = [None] * self.size
self.top = -1
def push(self, value):
if self.top == self.size - 1:
return "Overflow"
else:
self.top+=1
self.stack[self.top] = value
return None
def pop(self):
if self.top == -1:
return "Stack is empty"
else:
return self.stack[self.top]