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 | 271 Views, 16611 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 | 271 Views, 16611 Search Bots | 93 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Word Ordering in a Different Alphabetical Order
  2. Multitasking
  3. Non-decreasing Array with Single Modification
  4. Daily Interview Problem: Full Binary Tree
  5. Maximum In A Stack
  6. Algorithm Interview: Permutations of numbers
  7. Print a tree level-by-level, with line-breaks
  8. [Daily Problem] Angles of a Clock
  9. Most Frequent Subtree Sum
  10. Two Tricks of Delphi

Comments (0)

    Be the first one to comment this page !


Page Edited: October 30 2020 14:21:09 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">