To the Top
File:  root - text - article - 2019 - 11 - queue-using-two-stacks.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 330 Views, 18692 Search Bots | 93 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Apple:

Implement a queue class using two stacks. A queue is a data structure that supports the FIFO protocol (First in = first out). Your class should support the enqueue and dequeue methods like a standard queue.

Here's a starting point:


class Queue:
def __init__(self):
# Fill this in.

def enqueue(self, val):
# Fill this in.

def dequeue(self):
# Fill this in.

q = Queue()
q.enqueue(1)
q.enqueue(2)
q.enqueue(3)
print q.dequeue()
print q.dequeue()
print q.dequeue()
# 1 2 3
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 330 Views, 18692 Search Bots | 93 Words Subscribe to Feed Burner

Related Articles

  1. Two Tricks of Delphi
  2. Algorithm Interview Question: Symmetric k-ary Tree
  3. Find Pythagorean Triplets
  4. Daily Interview Problem: Spiral Traversal of Grid
  5. Staying on a Chess Board
  6. How to Play WAV music under DOS?
  7. Daily Interview Problem: Find the k-th Largest Element in a List
  8. Design Tic-Tac-Toe
  9. Daily Interview Problem: Min Stack
  10. Algorithm Interview: Permutations of numbers

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />