🌃
Limited Algorithm
search
⌘Ctrlk
🌃
Limited Algorithm
  • Summary
  • Hash & TreeMap
  • Queue &Stack & PQ
    • Cheat Sheet
    • Queue & Stack Concept & API
    • Interface Comparable& Cimparator
    • Priority Queue Concept & API
    • Practice 3 Stack & Queue & Deque Design
      • Implement Stack by LinkedList
      • Implement Stack by Array
      • Implement Queue by LinkedList
      • Implement Queue by Array
      • Design Circular Queue
      • Design Circular Deque
      • Implement Deque by Two Stacks
      • Implement Deque by Three Stacks
    • Practice 4 PriorityQueue
    • Practice 5 Top K and Kth Problem
  • Hybrid Data Structure
  • Graph
  • Graph Backtracking and Others
  • Tree
  • Pure Recursion & Backtracking
  • Dynamic Programming
  • Others
  • Array& LinkedList & String
  • Adavance Two Pointer
  • Advance Sliding Window
  • Advance Binary Search
  • Advance Young's Matrix
  • Java Knowledge
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Queue &Stack & PQ

Practice 3 Stack & Queue & Deque Design

Implement Stack by LinkedListchevron-rightImplement Stack by Arraychevron-rightImplement Queue by LinkedListchevron-rightImplement Queue by Arraychevron-rightDesign Circular Queuechevron-rightDesign Circular Dequechevron-rightImplement Deque by Two Stackschevron-rightImplement Deque by Three Stackschevron-right
PreviousDeep Dive: PriorityQueue需要如何比较两个item(自己定义的/原本就有的)chevron-leftNextImplement Stack by LinkedListchevron-right

Last updated 1 year ago