摘要: 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 num 阅读全文
posted @ 2019-03-20 21:18 月半榨菜 阅读(136) 评论(0) 推荐(0)
摘要: Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct element. 阅读全文
posted @ 2019-03-20 17:24 月半榨菜 阅读(123) 评论(0) 推荐(0)
摘要: Implement the following operations of a stack using queues. push(x) -- Push element x onto stack. pop() -- Removes the element on top of the stack. to 阅读全文
posted @ 2019-03-20 15:26 月半榨菜 阅读(111) 评论(0) 推荐(0)
摘要: 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 阅读全文
posted @ 2019-03-20 15:20 月半榨菜 阅读(134) 评论(0) 推荐(0)
摘要: Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. k is a positive integer and is less than or equal to 阅读全文
posted @ 2019-03-20 10:45 月半榨菜 阅读(99) 评论(0) 推荐(0)