Week 9-Odevler

Week 9- 1.odev.py

@@ -0,0 +1,48 @@
+from queue import Queue
+
+class Stack:
+
+    def __init__(self):
+        self.q1 = Queue()
+        self.q2 = Queue()
+        self.curr_size = 0
+
+    def push(self, x):
+        self.curr_size += 1
+        self.q2.put(x)
+        while (not self.q1.empty()):
+            self.q2.put(self.q1.queue[0])
+            self.q1.get()
+        self.q = self.q1
+        self.q1 = self.q2
+        self.q2 = self.q
+
+    def pop(self):
+        if (self.q1.empty()):
+            return
+        self.q1.get()
+        self.curr_size -= 1
+
+    def top(self):
+        if (self.q1.empty()):
+            return -1
+        return self.q1.queue[0]
+
+    def size(self):
+        return self.curr_size
+
+if __name__ == '__main__':
+    s = Stack()
+    s.push(1)
+    s.push(2)
+    s.push(3)
+
+    print("current size: ", s.size())
+    print(s.top())
+    s.pop()
+    print(s.top())
+    s.pop()
+    print(s.top())
+
+    print("current size: ", s.size())
+

Week 9-3.odev.py

@@ -0,0 +1,13 @@
+from collections import deque
+def generate(n):
+    q = deque()
+    q.append('1')
+
+    for i in range(n):
+        front = str(q.popleft())
+        q.append(front + '0')
+        q.append(front + '1')
+        print(front, end=' ')
+if __name__ == '__main__':
+    n = 16
+    generate(n)