starwavelin的专栏

Two Sums Assumptions: 开始答题前先和面试官确认 1. Is it possible that the given array has more than one solutions? 2. Do you want me just find one solution or all so

题目总论Scenario:Realize a stack which also has ability to return the minimum value within this stack to userAssumption: Assume interviewer allowed me to use already existing data structures in Java, such

题目总论Scenario二叉树的右视图Assumption就普通一个二叉树，不是二叉搜索树（是的话也跟这题没啥关系），不必要是满树、完全树等等；但这些问题你有可以跟面试官确认下。Input/Output先给LeetCode上的例子： 1 2 3 5 4 [1, 3, 4] 我一开始看这例子以为只要拿个while循环root.right.right…就好了，但哪里可能这么简单

LinkedList (LL)题目的一般解题技巧 1. 快慢指针 2. Return的LL头不确定时可用Dummy Node若无无特别指出LL均为单向链表 解题集 206 Reverse Linked List 86 Partition List 328 Odd Even Linked List 19 Remove nth node from end of list