# 数据结构类
### 图和树
MST, minimum spanning tree 最小生成树
Sparse matrix 稀疏矩阵
#数学类
hexadecimal 十六进制
decimal 十进制
factorial(n) 阶乘
factorial function 阶乘函数
fraction 分数
numerator(分子) denominator(分母)
Greatest Common Divisor (G.C.D.) 最大公约数
Lowest common multiple (LCM) 最小公倍数
# 其他类
1. spiral order 螺旋形顺序
Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.
For example,
Given n = 3
,
You should return the following matrix:
[ [ 1, 2, 3 ], [ 8, 9, 4 ], [ 7, 6, 5 ] ]
2. Permutation "排序"
The permutation is even if the number of inversions it contains is even.
如果一个排列中含有的反序的个数是偶数,则称它为偶排列。
3. Palindrome/Palindromic 回文的
4. anagram 重组字
dormitory = dirty room就是一对 anagrams,或者说"dirty room" 是"dormitory"的anagram
5. concatenation 字符串连接
You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and without any intervening characters.
For example, given:
S: "barfoothefoobarman"
L: ["foo", "bar"]
You should return the indices: [0,9]
.
(order does not matter).
6. Interleaving 交错;交叉
例
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.
For example,
Given:
s1 = "aabcc"
,
s2 = "dbbca"
,
When s3 = "aadbbcbcac"
, return true.
When s3 = "aadbbbaccc"
, return false.
7. Palindrome 回文串,Palindromic 回文的,有回文特性的
8. Prune (vi) 剪枝
successor and predecessor 后一个和前一个
A binary tree is threaded by making all right child pointers that would normally be null point to the inorder successor of the node, and all left child pointers that would normally be null point to the inorder predecessor of the node."
punctuator 标点符号