kidChen's Blog

Clone Graph ` java /** * Definition for undirected graph. * class UndirectedGraphNode { * int label; * ArrayList neighbors; * UndirectedGraphNode(int x) { label = x; neighbors =...

1. Dynamic Programming A method for solving a complex problem by breaking it down into a collection of simpler sub-problems. 1.1 When to use 1. One of the following three: - Maximum/Minimum Problem -...

1. Introduce Dummy Node When the head of the target list we want to return may be different from the original given list, we can use a dummy node linked to the result so that we can get what we want...

1. Binary Tree DFS Traversal 1.1 Recursion This method will cost O(n) time with no extra space. The space is assigned by system(which could be O(1) or O(h), h is the height of the tree). ` java...

Binary Search For a given sorted array (ascending order) and a target number, find the first index of this number in O(log n) time complexity. If the target number does not exist in the array, return...