jundalou

994.Rotting Oranges 腐烂的橙子

LeetCode 841.Keys and Rooms钥匙和房间

145.Binary Tree Postorder Traversal二叉树的后序遍历

94. Binary Tree Inorder Traversal 二叉树的中序遍历

Leetcode 144 Binary Tree Preorder Traversal 二叉树的前序遍历

无法播放？请 点击这里 跳转到Youtube 切换视频源： 题目链接：https://leetcode.com/problems/implement-queue-using-stacks/ GitHub答案源代码请点击这里 class MyQueue { Deque<Integer> stack1; Deque<Integer> stack2; /** Initialize your data structure here. */ public MyQueue() { stack1 = new ArrayDeque<>(); stack2 = new ArrayDeque<>(); } /** Push element x to the back of queue. */ public void push(int x) { stack1.push(x); } /** Removes the element from in

225 Implement Stack Using Queues

373. Find K Pairs with Smallest Sums查找和最小的k对数字

105. Construct binary tree from preorder and inorder traversal 单题解析

31 next permutation 单题讲解