Conventions for Notation in Probability Theory and Statistics
在不同的统计学(包括概率论, 信息论, 随机过程)教材中常常会见到不同的符号约定, 这里整理一下并作出说明.
在不同的统计学(包括概率论, 信息论, 随机过程)教材中常常会见到不同的符号约定, 这里整理一下并作出说明.
Ref:
《道是什么》演讲稿.
A trie (pronounced as "try") or prefix tree is a tree data structure used for storing and searching a specific key from a set, usually a string set.
Using Trie, search complexities can be brought to O(n)(n = key length).
208. Implement Trie (Prefix Tree)
204. Count Primes
Given an integer n, return the number of prime numbers that are strictly less than n.
Dynamic programming(DP) problems that typically use one pointer. E.g., Integer[] memo.
Problems like "given an 2D binary grid grid which represents a map of land and water, return the number of islands, an island is XXXX".
Ref: labuladong 题解