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

Related Articles

  1. Spectrum Master
  2. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  3. Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
  4. Algorithm Interview: Lowest Common Ancestor of 2 Nodes in Binary Tree
  5. Daily Interview Problem: Find the Number of Islands
  6. Generate All IP Addresses
  7. Daily Interview Puzzle: Ways to Traverse a Grid
  8. Palindrome Integers
  9. Algorithm Interview: Subarray With Target Sum
  10. Staying on a Chess Board

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" />