leetcode 239. Sliding Window Maximum

   
  leetcode
  2 minutes read (About 244 words)

题目

Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves right by one position. Return the max sliding window.

  dequeue, priorityQueue, queue
  Read More

leetcode 703. Kth Largest Element in a Stream

   
  leetcode
  a few seconds read (About 105 words)

Example:

1
2
3
4
5
6
7
8
int k = 3;
int[] arr = [4,5,8,2];
KthLargest kthLargest = new KthLargest(3, arr);
kthLargest.add(3);   // returns 4
kthLargest.add(5);   // returns 5
kthLargest.add(10);  // returns 5
kthLargest.add(9);   // returns 8
kthLargest.add(4);   // returns 8
  priorityQueue, queue
  Read More

leetcode 232. Implement Queue using Stacks

   
  leetcode
  a minute read (About 179 words)

Implement the following operations of a queue using stacks.

push(x) – Push element x to the back of queue.
pop() – Removes the element from in front of queue.
peek() – Get the front element.
empty() – Return whether the queue is empty.

  queue, stack
  Read More
  Follow

Tag Cloud

BST DFS array backtracking binary-search dequeue greedy linux map notbest priorityQueue queue redis stack tree two-pointers 栈 链表

Recent

Archives

Tags

BST 1
DFS 1
array 1
backtracking 1
binary-search 1
dequeue 1
greedy 1
linux 1
map 2
notbest 1
priorityQueue 2
queue 3
redis 1
stack 1
tree 4
two-pointers 1
栈 1
链表 3
Your browser is out-of-date!

Update your browser to view this website correctly. Update my browser now

×