面试题 03.02-栈的最小值(Min Stack LCCI) 原文链接: https://leetcode-cn.com/problems/min-stack-lcci 英文原文How would you design a stack which, in addition to push and 2021-12-03 栈设计 简单
面试题 03.04-化栈为队(Implement Queue using Stacks LCCI) 原文链接: https://leetcode-cn.com/problems/implement-queue-using-stacks-lcci 英文原文Implement a MyQueue class which implement 2021-12-03 栈设计队列 简单
面试题 04.01-节点间通路(Route Between Nodes LCCI) 原文链接: https://leetcode-cn.com/problems/route-between-nodes-lcci 英文原文Given a directed graph, design an algorithm to fin 2021-12-03 图广度优先搜索深度优先搜索 中等
面试题 03.01-三合一(Three in One LCCI) 原文链接: https://leetcode-cn.com/problems/three-in-one-lcci 英文原文Describe how you could use a single array to implement th 2021-12-03 数组栈设计 简单
面试题 03.05-栈排序(Sort of Stacks LCCI) 原文链接: https://leetcode-cn.com/problems/sort-of-stacks-lcci 英文原文Write a program to sort a stack such that the smallest 2021-12-03 单调栈栈设计 中等
面试题 04.02-最小高度树(Minimum Height Tree LCCI) 原文链接: https://leetcode-cn.com/problems/minimum-height-tree-lcci 英文原文Given a sorted (increasing order) array with uniqu 2021-12-03 二叉搜索树二叉树分治数组树 简单
面试题 04.03-特定深度节点链表(List of Depth LCCI) 原文链接: https://leetcode-cn.com/problems/list-of-depth-lcci 英文原文Given a binary tree, design an algorithm which creates a 2021-12-03 二叉树广度优先搜索树链表 中等
面试题 04.04-检查平衡性(Check Balance LCCI) 原文链接: https://leetcode-cn.com/problems/check-balance-lcci 英文原文Implement a function to check if a binary tree is balanc 2021-12-03 二叉树树深度优先搜索 简单
面试题 04.05-合法二叉搜索树(Legal Binary Search Tree LCCI) 原文链接: https://leetcode-cn.com/problems/legal-binary-search-tree-lcci 英文原文Implement a function to check if a binary tre 2021-12-03 二叉搜索树二叉树树深度优先搜索 中等
面试题 04.06-后继者(Successor LCCI) 原文链接: https://leetcode-cn.com/problems/successor-lcci 英文原文Write an algorithm to find the "next" node (i.e., 2021-12-03 二叉搜索树二叉树树深度优先搜索 中等