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

Related Articles

  1. Daily Interview Problem: Tree Serialization
  2. Daily Interview Problem: Merge K Sorted Linked Lists
  3. New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
  4. First and Last Indices of an Element in a Sorted Array
  5. Algorithm Interview: Shifted String
  6. Spreadsheet Columns
  7. Spectrum Master
  8. Algorithm Interview Question: H-Index
  9. Algorithm Interview: Convert Roman Numerals to Decimal
  10. Daily Interview Problem: Min Stack

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="index, follow">