Archives: 2019 | Liang Tan's Blog

Never really desperate, only the lost of the soul.

Liang Tan

2019

Let’s try to understand these 4 concept by an example. Suppose, You want to boil some water. Suppose you are Process A,

2019-08-10 Liang Tan

1. Problem DescriptionWe are given a binary tree (with root node root), a target node, and an integer value K. Return a

2019-07-16 Liang Tan

Recursion Data Structure and Algorithm Tree Undirected Graph Breath-First Search(BFS) Queue

1. Problem DescriptionIn an infinite binary tree where every node has two children, the nodes are labelled in row order.

2019-07-02 Liang Tan

Recursion Data Structure and Algorithm Complete Binary Tree ZigZag Math

Problem DescriptionWe have a sequence of books: the i-th book has thickness books[i][0] and height books[i][1]. We want

2019-07-02 Liang Tan

Data Structure and Algorithm Dynamic programming backtracking Depth-first Search (DFS) memorization

I have been using Spring framework to build my own projects for several time. In order to have a deeper understanding of

2019-06-26 Liang Tan

Spring MVC Web Server Gradle Java reflection Annotation Thread PostMan API

Let’s first look at how java use the factory method.At beginning, in order to unify all the manipulations on different S

2019-06-19 Liang Tan

OOD Design Pattern Factory Method Java Source Code Abstract Factory JDBC

            
1 / 3