数据结构
数据结构时间复杂度、空间复杂度算法时间复杂度以算法中基本操作重复执行的次数（简称 频度）作为算法的时间度量，只需要打字计算出相应的数量级即可
如：
O(1) < O(log2 (n)) < O(n) < O(nlog2 (n)) < O(n^2) < O(n^3) < O(2^n) < O(n!) <O(n^n)
大o表达式 T(n) = O(表达式) n —> 表示问题规模
加法规则：多项相加，保留最高阶项，并将系数化为1
T(n) = n^3+n^2 +nlog2(n) + n log2(n) = n^3
乘法规则：多项相乘都保留，并将系数化为1
T(n)=n*n^2 = n^3
T(n) = 2n^3*3n^4 = n^7
加法乘法混合规则：小括号再乘法规则而，最后加法规则
T(n)=n^2*n^3+n^3 = n^5 + n^3 = n^5
T(n)=(2n+3)(2n^4+4) = 2(n)\2(n^4)=n^5
T(n) = o(1)
1 2 4 8 16 32….n
...
Hello World
Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub.
Quick StartCreate a new post1$ hexo new "My New Post"
More info: Writing
Run server1$ hexo server
More info: Server
Generate static files1$ hexo generate
More info: Generating
Deploy to remote sites1$ hexo deploy
More info: Deployment
a:>h1{
color:#33
hight:32h
thi
...