Stan Cao

A backend developer.

LeetCode - The Stack Part

less than 1 minute read

The typical problems in LeetCode is the basic calculator series. The main idea is to use stack and read the input string from end to start if there’s bracket. Or we can read the string from the beginning and do it recursively.

Another prolem is the move to make increasing problem. see this (link)[https://www.geeksforgeeks.org/minimum-incrementdecrement-to-make-array-non-increasing/] for details.

You may also enjoy

K-D-tree

1 minute read

A k-dimensional or k-d tree is a binary tree used to subdivide a collection of records into ranges for k different attributes in each record.

B-tree

2 minute read

In the 1980s B-trees were applied to database management systems, with an emphasis on how to ensure consistent B-tree access patterns to support concurrency ...

Sorting

1 minute read

Sorting is always an important topic in computer science. Theoretically, comparison sorts cannot perform better than O(n lgn) in the best case, better perfor...