├── refs
    └── add.bib
├── .Rbuildignore
├── .Rproj.user
    ├── shared
    │   └── notebooks
    │   │   ├── patch-chunk-names
    │   │   ├── C7BDE1B7-deep_learn
    │   │       └── 1
    │   │       │   └── 4A13D08206E9C08B
    │   │       │       └── chunks.json
    │   │   └── paths
    └── 4A13D082
    │   ├── saved_source_markers
    │   ├── pcs
    │       ├── source-pane.pper
    │       ├── workbench-pane.pper
    │       ├── files-pane.pper
    │       └── windowlayoutstate.pper
    │   ├── sources
    │       └── prop
    │       │   ├── 7D30E6E5
    │       │   ├── 6B4EB6C4
    │       │   ├── 800F1B8A
    │       │   ├── A6145623
    │       │   └── INDEX
    │   ├── rmd-outputs
    │   └── persistent-state
├── code
    ├── build.R
    ├── build-model-notes.R
    ├── clean.R
    ├── copy-md.R
    ├── push.R
    ├── build-readme.R
    └── build-jupyter-notebook.R
├── .gitignore
├── figs
    ├── cow1.png
    ├── cow2.png
    ├── dcss1.png
    ├── dcss2.png
    ├── dp_1.png
    ├── hdck.png
    ├── jxfg.png
    ├── jzzl.png
    ├── khao.png
    ├── ljzh3.png
    ├── lxjz.png
    ├── lxjz2.png
    ├── tx_1.png
    ├── tyyx2.png
    ├── xztx.png
    ├── zuida.png
    ├── 不同路径.png
    ├── 买卖股票1.png
    ├── 买卖股票2.png
    ├── 买卖股票3.png
    ├── 买卖股票4.png
    ├── 买卖股票5.png
    ├── 买卖股票6.png
    ├── 买卖股票7.png
    ├── 买卖股票8.png
    ├── 买卖股票9.png
    ├── 公共祖先.png
    ├── 动态规划.png
    ├── 左叶子之和.png
    ├── 所有路径.png
    ├── 接雨水1.png
    ├── 爬楼梯.png
    ├── 盛水容器1.png
    ├── 盛水容器2.png
    ├── 路径总和.png
    ├── 跳跃游戏.png
    ├── array_1.png
    ├── deepth.png
    ├── dhhmzh.png
    ├── djjs3-1.png
    ├── djjs3-2.png
    ├── djjs3-3.png
    ├── lbggjd.png
    ├── ssewjz1.png
    ├── ssewjz2.png
    ├── 买卖股票10.png
    ├── 买卖股票11.png
    ├── 买卖股票12.png
    ├── 最长回文字符串.png
    ├── 盛水最多的容器.png
    ├── base_kg_1.png
    ├── base_kg_2.jpg
    ├── base_kg_3.png
    ├── jieyushui.png
    ├── lianbiao1.png
    ├── lianbiao2.png
    ├── lianbiao_1.png
    ├── lianbiao_2.png
    ├── lianbiao_3.png
    ├── 动态规划问题解题思路.png
    ├── 最短路径和的问题.png
    ├── cengcibianli.png
    ├── duichentree.png
    ├── fanzhuantree.png
    ├── lujingzonghe.png
    ├── pinghengtree.png
    ├── wanquan_tree.png
    ├── zuidasquare.png
    ├── 时间复杂度与空间复杂度.jpg
    ├── gonggongzixulie.jpg
    ├── xaingtongtree.png
    ├── huanxinglianbiao.png
    └── youxushuzuzhuantree.png
├── analysis
    ├── summary.Rmd
    ├── libs
    │   ├── gitbook-2.6.7
    │   │   ├── css
    │   │   │   ├── fontawesome
    │   │   │   │   └── fontawesome-webfont.ttf
    │   │   │   ├── plugin-clipboard.css
    │   │   │   ├── plugin-table.css
    │   │   │   ├── plugin-search.css
    │   │   │   ├── plugin-bookdown.css
    │   │   │   └── plugin-fontsettings.css
    │   │   └── js
    │   │   │   ├── plugin-clipboard.js
    │   │   │   ├── jquery.highlight.js
    │   │   │   ├── plugin-sharing.js
    │   │   │   ├── plugin-fontsettings.js
    │   │   │   ├── plugin-search.js
    │   │   │   ├── plugin-bookdown.js
    │   │   │   └── clipboard.min.js
    │   └── header-attrs-2.2
    │   │   └── header-attrs.js
    ├── Monotone_stack.Rmd
    ├── leetcode.Rmd
    ├── time_complexity.Rmd
    ├── jiano.Rmd
    ├── sort.py
    ├── base_kg.Rmd
    ├── k-num-sum.Rmd
    ├── array.Rmd
    ├── sort.Rmd
    ├── string.Rmd
    └── huisu.Rmd
├── libs
    ├── gitbook-2.6.7
    │   ├── css
    │   │   ├── fontawesome
    │   │   │   └── fontawesome-webfont.ttf
    │   │   ├── plugin-clipboard.css
    │   │   ├── plugin-table.css
    │   │   ├── plugin-search.css
    │   │   ├── plugin-bookdown.css
    │   │   └── plugin-fontsettings.css
    │   └── js
    │   │   ├── plugin-clipboard.js
    │   │   ├── jquery.highlight.js
    │   │   ├── plugin-sharing.js
    │   │   ├── plugin-fontsettings.js
    │   │   ├── plugin-search.js
    │   │   ├── plugin-bookdown.js
    │   │   └── clipboard.min.js
    ├── header-attrs-2.2
    │   └── header-attrs.js
    └── pagedtable-1.1
    │   └── css
    │       └── pagedtable.css
├── le_leetcode.Rproj
├── dandiao_stack.Rmd
├── cxmsbd_py.Rmd
├── slide_window.Rmd
├── Makefile
├── queue_and_stack.Rmd
├── README.md
├── py_base.Rmd
└── 栈和队列.html


/refs/add.bib:
--------------------------------------------------------------------------------
1 | 


--------------------------------------------------------------------------------
/.Rbuildignore:
--------------------------------------------------------------------------------
1 | ^Makefile$
2 | 


--------------------------------------------------------------------------------
/.Rproj.user/shared/notebooks/patch-chunk-names:
--------------------------------------------------------------------------------
1 | 


--------------------------------------------------------------------------------
/code/build.R:
--------------------------------------------------------------------------------
1 | rmarkdown::render("leetcode.Rmd")
2 | 
3 | 


--------------------------------------------------------------------------------
/.Rproj.user/4A13D082/saved_source_markers:
--------------------------------------------------------------------------------
1 | {"active_set":"","sets":[]}


--------------------------------------------------------------------------------
/.Rproj.user/4A13D082/pcs/source-pane.pper:
--------------------------------------------------------------------------------
1 | {
2 |     "activeTab": 0
3 | }


--------------------------------------------------------------------------------
/.gitignore:
--------------------------------------------------------------------------------
1 | .Rproj.user
2 | .Rhistory
3 | .RData
4 | .Ruserdata
5 | 


--------------------------------------------------------------------------------
/code/build-model-notes.R:
--------------------------------------------------------------------------------
1 | #rmarkdown::render("model_notes.Rmd")
2 | 
3 | 


--------------------------------------------------------------------------------
/figs/cow1.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/cow1.png


--------------------------------------------------------------------------------
/figs/cow2.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/cow2.png


--------------------------------------------------------------------------------
/figs/dcss1.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/dcss1.png


--------------------------------------------------------------------------------
/figs/dcss2.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/dcss2.png


--------------------------------------------------------------------------------
/figs/dp_1.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/dp_1.png


--------------------------------------------------------------------------------
/figs/hdck.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/hdck.png


--------------------------------------------------------------------------------
/figs/jxfg.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/jxfg.png


--------------------------------------------------------------------------------
/figs/jzzl.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/jzzl.png


--------------------------------------------------------------------------------
/figs/khao.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/khao.png


--------------------------------------------------------------------------------
/figs/ljzh3.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/ljzh3.png


--------------------------------------------------------------------------------
/figs/lxjz.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/lxjz.png


--------------------------------------------------------------------------------
/figs/lxjz2.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/lxjz2.png


--------------------------------------------------------------------------------
/figs/tx_1.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/tx_1.png


--------------------------------------------------------------------------------
/figs/tyyx2.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/tyyx2.png


--------------------------------------------------------------------------------
/figs/xztx.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/xztx.png


--------------------------------------------------------------------------------
/figs/zuida.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/zuida.png


--------------------------------------------------------------------------------
/figs/不同路径.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/不同路径.png


--------------------------------------------------------------------------------
/figs/买卖股票1.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/买卖股票1.png


--------------------------------------------------------------------------------
/figs/买卖股票2.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/买卖股票2.png


--------------------------------------------------------------------------------
/figs/买卖股票3.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/买卖股票3.png


--------------------------------------------------------------------------------
/figs/买卖股票4.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/买卖股票4.png


--------------------------------------------------------------------------------
/figs/买卖股票5.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/买卖股票5.png


--------------------------------------------------------------------------------
/figs/买卖股票6.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/买卖股票6.png


--------------------------------------------------------------------------------
/figs/买卖股票7.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/买卖股票7.png


--------------------------------------------------------------------------------
/figs/买卖股票8.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/买卖股票8.png


--------------------------------------------------------------------------------
/figs/买卖股票9.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/买卖股票9.png


--------------------------------------------------------------------------------
/figs/公共祖先.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/公共祖先.png


--------------------------------------------------------------------------------
/figs/动态规划.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/动态规划.png


--------------------------------------------------------------------------------
/figs/左叶子之和.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/左叶子之和.png


--------------------------------------------------------------------------------
/figs/所有路径.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/所有路径.png


--------------------------------------------------------------------------------
/figs/接雨水1.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/接雨水1.png


--------------------------------------------------------------------------------
/figs/爬楼梯.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/爬楼梯.png


--------------------------------------------------------------------------------
/figs/盛水容器1.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/盛水容器1.png


--------------------------------------------------------------------------------
/figs/盛水容器2.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/盛水容器2.png


--------------------------------------------------------------------------------
/figs/路径总和.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/路径总和.png


--------------------------------------------------------------------------------
/figs/跳跃游戏.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/跳跃游戏.png


--------------------------------------------------------------------------------
/figs/array_1.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/array_1.png


--------------------------------------------------------------------------------
/figs/deepth.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/deepth.png


--------------------------------------------------------------------------------
/figs/dhhmzh.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/dhhmzh.png


--------------------------------------------------------------------------------
/figs/djjs3-1.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/djjs3-1.png


--------------------------------------------------------------------------------
/figs/djjs3-2.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/djjs3-2.png


--------------------------------------------------------------------------------
/figs/djjs3-3.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/djjs3-3.png


--------------------------------------------------------------------------------
/figs/lbggjd.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/lbggjd.png


--------------------------------------------------------------------------------
/figs/ssewjz1.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/ssewjz1.png


--------------------------------------------------------------------------------
/figs/ssewjz2.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/ssewjz2.png


--------------------------------------------------------------------------------
/figs/买卖股票10.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/买卖股票10.png


--------------------------------------------------------------------------------
/figs/买卖股票11.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/买卖股票11.png


--------------------------------------------------------------------------------
/figs/买卖股票12.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/买卖股票12.png


--------------------------------------------------------------------------------
/figs/最长回文字符串.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/最长回文字符串.png


--------------------------------------------------------------------------------
/figs/盛水最多的容器.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/盛水最多的容器.png


--------------------------------------------------------------------------------
/figs/base_kg_1.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/base_kg_1.png


--------------------------------------------------------------------------------
/figs/base_kg_2.jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/base_kg_2.jpg


--------------------------------------------------------------------------------
/figs/base_kg_3.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/base_kg_3.png


--------------------------------------------------------------------------------
/figs/jieyushui.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/jieyushui.png


--------------------------------------------------------------------------------
/figs/lianbiao1.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/lianbiao1.png


--------------------------------------------------------------------------------
/figs/lianbiao2.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/lianbiao2.png


--------------------------------------------------------------------------------
/figs/lianbiao_1.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/lianbiao_1.png


--------------------------------------------------------------------------------
/figs/lianbiao_2.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/lianbiao_2.png


--------------------------------------------------------------------------------
/figs/lianbiao_3.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/lianbiao_3.png


--------------------------------------------------------------------------------
/figs/动态规划问题解题思路.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/动态规划问题解题思路.png


--------------------------------------------------------------------------------
/figs/最短路径和的问题.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/最短路径和的问题.png


--------------------------------------------------------------------------------
/figs/cengcibianli.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/cengcibianli.png


--------------------------------------------------------------------------------
/figs/duichentree.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/duichentree.png


--------------------------------------------------------------------------------
/figs/fanzhuantree.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/fanzhuantree.png


--------------------------------------------------------------------------------
/figs/lujingzonghe.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/lujingzonghe.png


--------------------------------------------------------------------------------
/figs/pinghengtree.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/pinghengtree.png


--------------------------------------------------------------------------------
/figs/wanquan_tree.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/wanquan_tree.png


--------------------------------------------------------------------------------
/figs/zuidasquare.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/zuidasquare.png


--------------------------------------------------------------------------------
/figs/时间复杂度与空间复杂度.jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/时间复杂度与空间复杂度.jpg


--------------------------------------------------------------------------------
/.Rproj.user/4A13D082/sources/prop/7D30E6E5:
--------------------------------------------------------------------------------
1 | {
2 |     "cursorPosition": "10,3",
3 |     "scrollLine": "0"
4 | }


--------------------------------------------------------------------------------
/figs/gonggongzixulie.jpg:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/gonggongzixulie.jpg


--------------------------------------------------------------------------------
/figs/xaingtongtree.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/xaingtongtree.png


--------------------------------------------------------------------------------
/.Rproj.user/4A13D082/pcs/workbench-pane.pper:
--------------------------------------------------------------------------------
1 | {
2 |     "TabSet1": 0,
3 |     "TabSet2": 0,
4 |     "TabZoom": {}
5 | }


--------------------------------------------------------------------------------
/figs/huanxinglianbiao.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/huanxinglianbiao.png


--------------------------------------------------------------------------------
/figs/youxushuzuzhuantree.png:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/figs/youxushuzuzhuantree.png


--------------------------------------------------------------------------------
/.Rproj.user/shared/notebooks/C7BDE1B7-deep_learn/1/4A13D08206E9C08B/chunks.json:
--------------------------------------------------------------------------------
1 | {"chunk_definitions":[],"doc_write_time":1585570632}


--------------------------------------------------------------------------------
/analysis/summary.Rmd:
--------------------------------------------------------------------------------
 1 | ## 算法思想小结
 2 | 
 3 | 
 4 | ## 分治之思想
 5 | 
 6 | 把任务分解为子任务，子任务的合并结果就是主任务的解
 7 | 
 8 | 典型：
 9 | 
10 | 快速排序
11 | 二分法查找


--------------------------------------------------------------------------------
/code/clean.R:
--------------------------------------------------------------------------------
1 | library(tidyverse)
2 | fs::dir_ls(".", regexp = "\\.md$") %>%
3 |     str_subset("README|LICENSE", negate = TRUE) %>%
4 |     map(file.remove)
5 | 


--------------------------------------------------------------------------------
/code/copy-md.R:
--------------------------------------------------------------------------------
1 | rmarkdown::render("commit.Rmd")
2 | library(magrittr)
3 | readr::read_lines("commit.md") %>%
4 |     clipr::write_clip(allow_non_interactive = TRUE)
5 | 


--------------------------------------------------------------------------------
/code/push.R:
--------------------------------------------------------------------------------
1 | git2r::add(path = ".")
2 | git2r::commit(message = "build gitbook")
3 | git2r::push(name = 'origin', refspec = "refs/heads/master", cred = git2r::cred_token())
4 | 


--------------------------------------------------------------------------------
/libs/gitbook-2.6.7/css/fontawesome/fontawesome-webfont.ttf:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/libs/gitbook-2.6.7/css/fontawesome/fontawesome-webfont.ttf


--------------------------------------------------------------------------------
/analysis/libs/gitbook-2.6.7/css/fontawesome/fontawesome-webfont.ttf:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/gaowenxin95/leetcode-cookbook/HEAD/analysis/libs/gitbook-2.6.7/css/fontawesome/fontawesome-webfont.ttf


--------------------------------------------------------------------------------
/.Rproj.user/4A13D082/sources/prop/6B4EB6C4:
--------------------------------------------------------------------------------
1 | {
2 |     "cursorPosition": "3,0",
3 |     "docOutlineSize": "40",
4 |     "docOutlineVisible": "1",
5 |     "scrollLine": "0",
6 |     "tempName": "Untitled2"
7 | }


--------------------------------------------------------------------------------
/.Rproj.user/4A13D082/sources/prop/800F1B8A:
--------------------------------------------------------------------------------
1 | {
2 |     "tempName": "Untitled2",
3 |     "cursorPosition": "13,2",
4 |     "scrollLine": "0",
5 |     "docOutlineSize": "40",
6 |     "docOutlineVisible": "1"
7 | }


--------------------------------------------------------------------------------
/.Rproj.user/4A13D082/sources/prop/A6145623:
--------------------------------------------------------------------------------
1 | {
2 |     "tempName": "Untitled2",
3 |     "cursorPosition": "1,15",
4 |     "scrollLine": "0",
5 |     "docOutlineSize": "40",
6 |     "docOutlineVisible": "1"
7 | }


--------------------------------------------------------------------------------
/analysis/Monotone_stack.Rmd:
--------------------------------------------------------------------------------
 1 | ---
 2 | title : 单调栈专题
 3 | author: 高文欣
 4 | date: "`r Sys.Date()`"
 5 | output: bookdown::gitbook
 6 | bibliography: refs/add.bib
 7 | ---
 8 | 
 9 | # 单调栈
10 | 
11 | # 定义
12 | 
13 | 


--------------------------------------------------------------------------------
/.Rproj.user/4A13D082/pcs/files-pane.pper:
--------------------------------------------------------------------------------
1 | {
2 |     "sortOrder": [
3 |         {
4 |             "columnIndex": 2,
5 |             "ascending": true
6 |         }
7 |     ],
8 |     "path": "A:/Gaowenxin_notes/leetcode/leetcode-cookbook"
9 | }


--------------------------------------------------------------------------------
/code/build-readme.R:
--------------------------------------------------------------------------------
1 | rmarkdown::render("README.Rmd")
2 | git2r::add(path = "*README*")
3 | git2r::add(path = "*readme*")
4 | git2r::commit(message = "update readme")
5 | git2r::push(name = 'origin', refspec = "refs/heads/master", cred = git2r::cred_token())
6 | 


--------------------------------------------------------------------------------
/code/build-jupyter-notebook.R:
--------------------------------------------------------------------------------
1 | library(tidyverse)
2 | # read_lines("notebook.md") %>%
3 | #     str_replace("^## \\d+\\. ", "### ") %>%
4 | #     write_lines("notebook.md")
5 | # read_lines("Ex50.md") %>%
6 | #     str_replace("^## ", "# ") %>%
7 | #     write_lines("Ex50.md")
8 | 


--------------------------------------------------------------------------------
/analysis/leetcode.Rmd:
--------------------------------------------------------------------------------
 1 | ---
 2 | title : 剑指offer
 3 | author: 高文欣
 4 | date: "`r Sys.Date()`"
 5 | output: bookdown::gitbook
 6 | bibliography: refs/add.bib
 7 | ---
 8 | 
 9 | # 数据结构算法
10 | 
11 | 每日一问：你的能力够彪悍了嘛？
12 | 
13 | ## 二叉树问题
14 | ```{r child='}
15 | 
16 | ```
17 | 
18 | 


--------------------------------------------------------------------------------
/le_leetcode.Rproj:
--------------------------------------------------------------------------------
 1 | Version: 1.0
 2 | 
 3 | RestoreWorkspace: Default
 4 | SaveWorkspace: Default
 5 | AlwaysSaveHistory: Default
 6 | 
 7 | EnableCodeIndexing: Yes
 8 | UseSpacesForTab: Yes
 9 | NumSpacesForTab: 2
10 | Encoding: UTF-8
11 | 
12 | RnwWeave: knitr
13 | LaTeX: XeLaTeX
14 | 
15 | BuildType: Makefile
16 | 


--------------------------------------------------------------------------------
/dandiao_stack.Rmd:
--------------------------------------------------------------------------------
 1 | ---
 2 | title : 单调栈
 3 | author: 高文欣
 4 | date: "`r Sys.Date()`"
 5 | output: bookdown::gitbook
 6 | bibliography: refs/add.bib
 7 | ---
 8 | 
 9 | # 单调栈
10 | 
11 | ## 定义
12 | 
13 | 单调栈是指栈内元素是具有有单调性的栈，单调栈在入栈的时候，需要将待入栈的元素和栈顶元素进行对比，看待加入栈的元素入栈后是否会破坏栈的单调性，如果不会，直接入栈；否则一直弹出到满足条件为止。
14 | 
15 | 单调递增栈：从栈顶到栈底数据从小到大
16 | 单调递减栈：从栈顶到栈底数据从大到小
17 | 
18 | 


--------------------------------------------------------------------------------
/.Rproj.user/4A13D082/pcs/windowlayoutstate.pper:
--------------------------------------------------------------------------------
 1 | {
 2 |     "left": {
 3 |         "splitterpos": 238,
 4 |         "topwindowstate": "NORMAL",
 5 |         "panelheight": 631,
 6 |         "windowheight": 669
 7 |     },
 8 |     "right": {
 9 |         "splitterpos": 400,
10 |         "topwindowstate": "NORMAL",
11 |         "panelheight": 631,
12 |         "windowheight": 669
13 |     }
14 | }


--------------------------------------------------------------------------------
/libs/gitbook-2.6.7/css/plugin-clipboard.css:
--------------------------------------------------------------------------------
 1 | div.sourceCode {
 2 |   position: relative;
 3 | }
 4 | 
 5 | .copy-to-clipboard-button {
 6 |   position: absolute;
 7 |   right: 0;
 8 |   top: 0;
 9 |   visibility: hidden;
10 | }
11 | 
12 | .copy-to-clipboard-button:focus {
13 |   outline: 0;
14 | }
15 | 
16 | div.sourceCode:hover > .copy-to-clipboard-button {
17 |   visibility: visible;
18 | }
19 | 


--------------------------------------------------------------------------------
/analysis/libs/gitbook-2.6.7/css/plugin-clipboard.css:
--------------------------------------------------------------------------------
 1 | div.sourceCode {
 2 |   position: relative;
 3 | }
 4 | 
 5 | .copy-to-clipboard-button {
 6 |   position: absolute;
 7 |   right: 0;
 8 |   top: 0;
 9 |   visibility: hidden;
10 | }
11 | 
12 | .copy-to-clipboard-button:focus {
13 |   outline: 0;
14 | }
15 | 
16 | div.sourceCode:hover > .copy-to-clipboard-button {
17 |   visibility: visible;
18 | }
19 | 


--------------------------------------------------------------------------------
/.Rproj.user/4A13D082/rmd-outputs:
--------------------------------------------------------------------------------
 1 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/leetcode-hot-100.html
 2 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/leetcode-hot-100.html
 3 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/leetcode-hot-100.html
 4 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/leetcode-hot-100.html
 5 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/leetcode-hot-100.html
 6 | 
 7 | 
 8 | 
 9 | 
10 | 
11 | 


--------------------------------------------------------------------------------
/cxmsbd_py.Rmd:
--------------------------------------------------------------------------------
 1 | ---
 2 | title: "stack_queue"
 3 | author: "wenxin Gao"
 4 | date: "2020/9/20"
 5 | output: html_document
 6 | ---
 7 | 
 8 | # 栈和队列
 9 | 
10 | ## 定义
11 | 
12 | **栈**：后进先出（LIFO-last in first out）:最后插入的元素最先出来。
13 | 
14 | **队列**：先进先出（FIFO-first in first out）:最先插入的元素最先出来
15 | 
16 | pop和peek都可以返回栈顶元素，时间复杂度是O(1)
17 | stack1.peek() 返回栈顶元素，但不在堆栈中删除它。
18 | Stack2.pop() 返回栈顶元素，并在进程中删除它。
19 | 
20 | 栈这里考的辅助栈比较多一点


--------------------------------------------------------------------------------
/slide_window.Rmd:
--------------------------------------------------------------------------------
 1 | 
 2 | 
 3 | # 滑动窗口
 4 | 
 5 | 模板
 6 | 
 7 | ```r
 8 | int left = 0, right = 0;
 9 | 
10 | while (right < s.size()) {
11 |     // 增大窗口
12 |     window.add(s[right]);
13 |     right++;
14 |     
15 |     while (window needs shrink) {
16 |         // 缩小窗口
17 |         window.remove(s[left]);
18 |         left++;
19 |     }
20 | }
21 | ```
22 | 
23 | [labuladong](https://leetcode.cn/problems/find-all-anagrams-in-a-string/solutions/9749/hua-dong-chuang-kou-tong-yong-si-xiang-jie-jue-zi-/)
24 | 


--------------------------------------------------------------------------------
/libs/header-attrs-2.2/header-attrs.js:
--------------------------------------------------------------------------------
 1 | // Pandoc 2.9 adds attributes on both header and div. We remove the former (to
 2 | // be compatible with the behavior of Pandoc < 2.8).
 3 | document.addEventListener('DOMContentLoaded', function(e) {
 4 |   var hs = document.querySelectorAll("div.section[class*='level'] > :first-child");
 5 |   var i, h, a;
 6 |   for (i = 0; i < hs.length; i++) {
 7 |     h = hs[i];
 8 |     if (!/^h[1-6]$/i.test(h.tagName)) continue;  // it should be a header h1-h6
 9 |     a = h.attributes;
10 |     while (a.length > 0) h.removeAttribute(a[0].name);
11 |   }
12 | });
13 | 


--------------------------------------------------------------------------------
/analysis/libs/header-attrs-2.2/header-attrs.js:
--------------------------------------------------------------------------------
 1 | // Pandoc 2.9 adds attributes on both header and div. We remove the former (to
 2 | // be compatible with the behavior of Pandoc < 2.8).
 3 | document.addEventListener('DOMContentLoaded', function(e) {
 4 |   var hs = document.querySelectorAll("div.section[class*='level'] > :first-child");
 5 |   var i, h, a;
 6 |   for (i = 0; i < hs.length; i++) {
 7 |     h = hs[i];
 8 |     if (!/^h[1-6]$/i.test(h.tagName)) continue;  // it should be a header h1-h6
 9 |     a = h.attributes;
10 |     while (a.length > 0) h.removeAttribute(a[0].name);
11 |   }
12 | });
13 | 


--------------------------------------------------------------------------------
/.Rproj.user/4A13D082/persistent-state:
--------------------------------------------------------------------------------
1 | build-last-errors="[]"
2 | build-last-errors-base-dir=""
3 | build-last-outputs="[]"
4 | compile_pdf_state="{\"tab_visible\":false,\"running\":false,\"target_file\":\"\",\"output\":\"\",\"errors\":[]}"
5 | files.monitored-path=""
6 | find-in-files-state="{\"handle\":\"\",\"input\":\"\",\"path\":\"\",\"regex\":false,\"ignoreCase\":false,\"results\":{\"file\":[],\"line\":[],\"lineValue\":[],\"matchOn\":[],\"matchOff\":[],\"replaceMatchOn\":[],\"replaceMatchOff\":[]},\"running\":false,\"replace\":false,\"preview\":false,\"gitFlag\":false,\"replacePattern\":\"\"}"
7 | imageDirtyState="1"
8 | saveActionState="-1"
9 | 


--------------------------------------------------------------------------------
/libs/gitbook-2.6.7/css/plugin-table.css:
--------------------------------------------------------------------------------
1 | .book .book-body .page-wrapper .page-inner section.normal table{display:table;width:100%;border-collapse:collapse;border-spacing:0;overflow:auto}.book .book-body .page-wrapper .page-inner section.normal table td,.book .book-body .page-wrapper .page-inner section.normal table th{padding:6px 13px;border:1px solid #ddd}.book .book-body .page-wrapper .page-inner section.normal table tr{background-color:#fff;border-top:1px solid #ccc}.book .book-body .page-wrapper .page-inner section.normal table tr:nth-child(2n){background-color:#f8f8f8}.book .book-body .page-wrapper .page-inner section.normal table th{font-weight:700}
2 | 


--------------------------------------------------------------------------------
/analysis/libs/gitbook-2.6.7/css/plugin-table.css:
--------------------------------------------------------------------------------
1 | .book .book-body .page-wrapper .page-inner section.normal table{display:table;width:100%;border-collapse:collapse;border-spacing:0;overflow:auto}.book .book-body .page-wrapper .page-inner section.normal table td,.book .book-body .page-wrapper .page-inner section.normal table th{padding:6px 13px;border:1px solid #ddd}.book .book-body .page-wrapper .page-inner section.normal table tr{background-color:#fff;border-top:1px solid #ccc}.book .book-body .page-wrapper .page-inner section.normal table tr:nth-child(2n){background-color:#f8f8f8}.book .book-body .page-wrapper .page-inner section.normal table th{font-weight:700}
2 | 


--------------------------------------------------------------------------------
/Makefile:
--------------------------------------------------------------------------------
 1 | jupyter:
 2 | 
 3 | 	jupyter nbconvert --to markdown --output-dir . --NbConvertApp.output_files_dir=libs \
 4 | 		analysis/numpy_irr.ipynb
 5 | 
 6 | 	jupyter nbconvert --to markdown --output-dir . --NbConvertApp.output_files_dir=libs \
 7 | 	project/which_debts_are_worth_the_bank_s_effort/notebook.ipynb
 8 | 
 9 | 	Rscript code/build-jupyter-notebook.R
10 | 
11 | cookbook:
12 | 
13 | 	Rscript code/build.R
14 | 
15 | model:
16 | 
17 | 	Rscript code/build-model-notes.R
18 | 
19 | readme:
20 | 
21 | 	Rscript code/build-readme.R
22 | 
23 | push:
24 | 
25 | 	Rscript code/push.R
26 | 
27 | copy:
28 | 
29 | 	Rscript code/copy-md.R
30 | 
31 | clean:
32 | 
33 | 	Rscript code/clean.R
34 | 
35 | all: jupyter cookbook clean push
36 | 


--------------------------------------------------------------------------------
/analysis/time_complexity.Rmd:
--------------------------------------------------------------------------------
 1 | ## 时间复杂度
 2 | 
 3 | 时间复杂度计算问题~
 4 | 
 5 | 在计算时间复杂度时，只需关注循环次数最多的那段代码即可。也就是算法中某条语句的执行次数~
 6 | 
 7 | ### 常见的时间复杂度
 8 | 
 9 | （1）O(1)：常量阶，运行时间为常量 #常见输入输出或者赋值语句
10 | 
11 | （2）O(logn)：对数阶，如二分搜索算法 #这里的log一般以2为底
12 | 
13 | （3）O(n)：线性阶，如n个数内找最大值 # 一般单层for循环
14 | 
15 | （4）O(nlogn)：对数阶，如**快速排序算法，归并排序** 
16 | 
17 | （5）O(n^2)：平方阶，如选择排序，冒泡排序 #双层for循环
18 | 
19 | （6）O(n^3)：立方阶，如两个n阶矩阵的乘法运算
20 | 
21 | （7）O(2^n)：指数阶，如n个元素集合的所有**子集**的算法
22 | 
23 | （8）O(n!)：阶乘阶，如n个元素全部排列的算法
24 | 
25 | $$\mathrm{O}(1)<\mathrm{O}(\log n)<\mathrm{O}(n)<\mathrm{O}(n \log n)<\mathrm{O}\left(n^{2}\right)<\mathrm{O}\left(n^{3}\right)<\mathrm{O}\left(2^{n}\right)<\mathrm{O}(n !)<\mathrm{O}\left(n^{n}\right)$$
26 | 
27 | 
28 | 感觉还是需要举个例子


--------------------------------------------------------------------------------
/queue_and_stack.Rmd:
--------------------------------------------------------------------------------
 1 | ---
 2 | title : 栈和队列
 3 | author: 高文欣
 4 | date: "`r Sys.Date()`"
 5 | output: bookdown::gitbook
 6 | bibliography: refs/add.bib
 7 | ---
 8 | 
 9 | # 栈和队列
10 | 
11 | ## 栈与递归的关系
12 | 
13 | 
14 | 通常,当在一个函数的运行期间调用另一个函数时,在运行被调用函数之前,系统要做三件事:
15 | 
16 | 
17 | - 将所有的实参,返回地址等信息调用传递给被调用函数保存;
18 | - 为被调用函数的局部变量分配存储空间;
19 | - 将控制权转移到被调用函数入口;
20 | 
21 | 一个递归函数的运行过程类似多个函数的嵌套调用,只是调用函数和被调用函数都是同一个函数,因此,每次调用本身时,就会产生一个调用相关的一个重要概念就是递归函数运行的"层次".假设调用该递归函数的主函数为第0层,则从主函数调用递归函数进入到第一层,从第i层递归调用本函数进入下一层为第i+1层,反之退出第i层递归函数返回上一层为第i-1层;
22 | 为了保证递归函数正确执行,系统需要设立一个"递归工作栈"作为整个递归函数运行期间使用的数据存储区,每一层递归所需信息构成一个工作记录,其中包括所有实参,所有局部变量以及上一层的返回地址.每进入一层递归,就产生一个新的工作记录压入栈顶,每退出一个递归,就从栈顶弹出一个工作记录,则当前执行层的工作记录必须是递归工作栈栈顶的工作记录,此称为"活动记录";[【ChaosHeart】](https://www.jianshu.com/p/0d62fc267520)
23 | 


--------------------------------------------------------------------------------
/libs/gitbook-2.6.7/css/plugin-search.css:
--------------------------------------------------------------------------------
 1 | .book .book-summary .book-search {
 2 |   padding: 6px;
 3 |   background: transparent;
 4 |   position: absolute;
 5 |   top: -50px;
 6 |   left: 0px;
 7 |   right: 0px;
 8 |   transition: top 0.5s ease;
 9 | }
10 | .book .book-summary .book-search input,
11 | .book .book-summary .book-search input:focus,
12 | .book .book-summary .book-search input:hover {
13 |   width: 100%;
14 |   background: transparent;
15 |   border: 1px solid #ccc;
16 |   box-shadow: none;
17 |   outline: none;
18 |   line-height: 22px;
19 |   padding: 7px 4px;
20 |   color: inherit;
21 |   box-sizing: border-box;
22 | }
23 | .book.with-search .book-summary .book-search {
24 |   top: 0px;
25 | }
26 | .book.with-search .book-summary ul.summary {
27 |   top: 50px;
28 | }
29 | .with-search .summary li[data-level] a[href*=".html#"] {
30 |   display: none;
31 | }
32 | 


--------------------------------------------------------------------------------
/analysis/libs/gitbook-2.6.7/css/plugin-search.css:
--------------------------------------------------------------------------------
 1 | .book .book-summary .book-search {
 2 |   padding: 6px;
 3 |   background: transparent;
 4 |   position: absolute;
 5 |   top: -50px;
 6 |   left: 0px;
 7 |   right: 0px;
 8 |   transition: top 0.5s ease;
 9 | }
10 | .book .book-summary .book-search input,
11 | .book .book-summary .book-search input:focus,
12 | .book .book-summary .book-search input:hover {
13 |   width: 100%;
14 |   background: transparent;
15 |   border: 1px solid #ccc;
16 |   box-shadow: none;
17 |   outline: none;
18 |   line-height: 22px;
19 |   padding: 7px 4px;
20 |   color: inherit;
21 |   box-sizing: border-box;
22 | }
23 | .book.with-search .book-summary .book-search {
24 |   top: 0px;
25 | }
26 | .book.with-search .book-summary ul.summary {
27 |   top: 50px;
28 | }
29 | .with-search .summary li[data-level] a[href*=".html#"] {
30 |   display: none;
31 | }
32 | 


--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
 1 | # leetcode-cookbook
 2 | 
 3 | 
 4 | - [二叉树](https://gaowenxin95.github.io/leetcode-cookbook/二叉树专题.html)
 5 | 
 6 | - [动态规划](https://gaowenxin95.github.io/leetcode-cookbook/analysis/动态规划问题.html)
 7 | 
 8 | - [链表](https://gaowenxin95.github.io/leetcode-cookbook/analysis/链表问题.html)
 9 | 
10 | - [回溯](https://gaowenxin95.github.io/leetcode-cookbook/analysis/回溯专题.html)
11 | 
12 | - [贪心](https://gaowenxin95.github.io/leetcode-cookbook/analysis/贪心专题.html)
13 | 
14 | - [必会10大排序算法](https://gaowenxin95.github.io/leetcode-cookbook/analysis/十大经典排序.html)
15 | 
16 | - [字符串](https://gaowenxin95.github.io/leetcode-cookbook/analysis/字符串专题.html)
17 | 
18 | - [数组](https://gaowenxin95.github.io/leetcode-cookbook/analysis/数组专题.html)
19 | 
20 | - [剑指offer68道题解](https://gaowenxin95.github.io/leetcode-cookbook/剑指offer题解.html)
21 | 
22 | - [hot100](https://gaowenxin95.github.io/leetcode-cookbook/leetcode-hot-100.html)
23 | 
24 | 
25 | 
26 | 持续更新。。。
27 | 
28 | 老铁们加油哇~
29 | 算法八股文必考~
30 | 基础不牢，地动山摇~
31 | 


--------------------------------------------------------------------------------
/libs/gitbook-2.6.7/js/plugin-clipboard.js:
--------------------------------------------------------------------------------
 1 | gitbook.require(["gitbook", "jQuery"], function(gitbook, $) {
 2 | 
 3 |   var copyButton = '<button type="button" class="copy-to-clipboard-button" title="Copy to clipboard" aria-label="Copy to clipboard"><i class="fa fa-copy"></i></button>';
 4 |   var clipboard;
 5 | 
 6 |   gitbook.events.bind("page.change", function() {
 7 | 
 8 |     if (!ClipboardJS.isSupported()) return;
 9 | 
10 |     // the page.change event is thrown twice: before and after the page changes
11 |     if (clipboard) {
12 |       // clipboard is already defined
13 |       // we can deduct that we are before page changes
14 |       clipboard.destroy(); // destroy the previous events listeners
15 |       clipboard = undefined; // reset the clipboard object
16 |       return;
17 |     }
18 | 
19 |     $(copyButton).prependTo("div.sourceCode");
20 | 
21 |     clipboard = new ClipboardJS(".copy-to-clipboard-button", {
22 |       text: function(trigger) {
23 |         return trigger.parentNode.textContent;
24 |       }
25 |     });
26 | 
27 |   });
28 | 
29 | });
30 | 


--------------------------------------------------------------------------------
/analysis/libs/gitbook-2.6.7/js/plugin-clipboard.js:
--------------------------------------------------------------------------------
 1 | gitbook.require(["gitbook", "jQuery"], function(gitbook, $) {
 2 | 
 3 |   var copyButton = '<button type="button" class="copy-to-clipboard-button" title="Copy to clipboard" aria-label="Copy to clipboard"><i class="fa fa-copy"></i></button>';
 4 |   var clipboard;
 5 | 
 6 |   gitbook.events.bind("page.change", function() {
 7 | 
 8 |     if (!ClipboardJS.isSupported()) return;
 9 | 
10 |     // the page.change event is thrown twice: before and after the page changes
11 |     if (clipboard) {
12 |       // clipboard is already defined
13 |       // we can deduct that we are before page changes
14 |       clipboard.destroy(); // destroy the previous events listeners
15 |       clipboard = undefined; // reset the clipboard object
16 |       return;
17 |     }
18 | 
19 |     $(copyButton).prependTo("div.sourceCode");
20 | 
21 |     clipboard = new ClipboardJS(".copy-to-clipboard-button", {
22 |       text: function(trigger) {
23 |         return trigger.parentNode.textContent;
24 |       }
25 |     });
26 | 
27 |   });
28 | 
29 | });
30 | 


--------------------------------------------------------------------------------
/py_base.Rmd:
--------------------------------------------------------------------------------
 1 | ---
 2 | title: python基础
 3 | author: 高文欣
 4 | date: "`r Sys.Date()`"
 5 | output: 
 6 |     bookdown::gitbook:
 7 |         split_by: none
 8 |         split_bib: TRUE
 9 |         df_print: paged
10 | bibliography: refs/add.bib
11 | ---
12 | 
13 | # python基础复习
14 | 
15 | ## pop
16 | 
17 | 这几个要记住,哈哈
18 | 
19 | 还是切片那里的
20 | 
21 | ```r
22 | sentence=['All', 'good', 'things', 'come', 'to' ,'those', 'who', 'wait.']
23 | print("默认为 index=-1，删除最后一个列表值：",sentence.pop(-1),"\n")
24 | print("默认删除最后一个列表值： ",sentence.pop(),"\n")
25 | print("删除第一个元素：",sentence.pop(0),"\n")
26 | print("删除第三个元素：",sentence.pop(2),"\n")print("输出剩余元素：",sentence)
27 | 
28 | ```
29 | 
30 | ### python切片复习
31 | 
32 | object[start_index:end_index:step]
33 | step为正就是从左往右取值
34 | step为负就是从右往左取值
35 | 不包括end_index
36 | 参考[csdn](https://www.jianshu.com/p/15715d6f4dad)
37 | 
38 | ```r
39 | a=['1','2','3']
40 | c=a[::-1]
41 | c
42 | #['3', '2', '1']
43 | ```
44 | 
45 | 需要记住的几个 
46 | ```r
47 | a = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
48 | 
49 | >>>a[:] #从左往右
50 | >>> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
51 | >>>a[::]#从左往右
52 | >>> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
53 | >>>a[::-1]#从右往左
54 | >>> [9, 8, 7, 6, 5, 4, 3, 2, 1, 0]
55 | ```
56 | 


--------------------------------------------------------------------------------
/analysis/jiano.Rmd:
--------------------------------------------------------------------------------
 1 | ---
 2 | title: "Untitled"
 3 | author: "wenxin Gao"
 4 | date: "2020/9/19"
 5 | output: html_document
 6 | ---
 7 | 
 8 | ```{r,warning=FALSE}
 9 | 
10 | 
11 | library(forecast)
12 | library(fUnitRoots)
13 | 
14 | ```
15 | 
16 | ```{r}
17 | data <- readxl::read_xlsx("D:/JupyterNotebook/E/data/n.xlsx")
18 | 
19 | View(data)
20 | 
21 | ```
22 | 
23 | ```{r}
24 | 
25 | library(devtools)
26 | #install_github('sinhrks/ggfortify')
27 | ```
28 | 
29 | ```{r}
30 | library(ggplot2)
31 | 
32 | ```
33 | 
34 | 
35 | ```{r}
36 | clears <- ts(data[,2])
37 | plot.ts(clears, xlab = "时间", ylab = "能见度")
38 | ```
39 | 
40 | 
41 | ```{r}
42 | library(magrittr)
43 | # 自相关图
44 | acf(data[,2])
45 | 
46 | # 单位根检验
47 | unitrootTest(data[,2] %>% as.matrix())
48 | 
49 | # 对原始序列进行 一阶差分，并进行 平稳性和白噪声检验
50 | # 一阶差分
51 | # 语法:（默认）diff(x, lag = 1, diff= 1, …)
52 | # 若x是一个数值向量，则表示后一项减前一项，即滞后一阶差分；
53 | # lag 表示滞后项
54 | # 如果要指定差分的阶数，则一定要使用带名称的参数:diff=2
55 | 
56 | # sample表示样本数据。
57 | # 1、diff(sample,2)表示是对滞后2阶的数据进行差分，一阶差分，等同于：diff(sample,lag=2)
58 | # 2、diff(sample,diff=2)才是表示二阶差分
59 | 
60 | 
61 | 
62 | # 单位根检验
63 | unitrootTest(data[,2]%>% as.matrix())
64 | 
65 | # 白噪声检验
66 | Box.test(data[,2]%>% as.matrix(), type="Ljung-Box") 
67 | 
68 | # 偏自相关图
69 | pacf(data[,2])
70 | 
71 | # ARIMA(1,1,0)模型
72 | # ARIMA(p，d，q)模型全称为差分自回归移动平均模型(Autoregressive Integrated Moving Average Model,简记ARIMA)，
73 | # AR是自回归， p为自回归项；
74 | # MA为移动平均，q为移动平均项数;
75 | # d为时间序列成为平稳时所做的差分次数。
76 | 
77 | arima <- arima(data[,2], order = c(1, 0, 1))
78 | arima
79 | 
80 | # forecast <- forecast.Arima(arima, h = 5, level = c(99.5))
81 | forecast <- forecast(arima, h = 20, level = c(99.5))
82 | forecast
83 | plot(forecast)
84 | 
85 | # tsdiag检验
86 | tsdiag(arima)
87 | ```
88 | 
89 | 
90 | 
91 | 


--------------------------------------------------------------------------------
/.Rproj.user/shared/notebooks/paths:
--------------------------------------------------------------------------------
 1 | A:/Gaowenxin_notes/DL/deep_learn.Rmd="C7BDE1B7"
 2 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/JZ_offer.Rmd="E14F3488"
 3 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/Makefile="1E703314"
 4 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/README.md="B0F96EDB"
 5 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/analysis/DP.Rmd="B0AF1DB3"
 6 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/analysis/array.Rmd="E52C0C24"
 7 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/analysis/base_kg.Rmd="04FBF0E9"
 8 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/analysis/huisu.Rmd="6E06B2EC"
 9 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/analysis/jiano.Rmd="61CD4E8A"
10 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/analysis/k-num-sum.Rmd="FCF1A918"
11 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/analysis/lianbiao.Rmd="99467691"
12 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/analysis/sort.Rmd="1C57B973"
13 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/analysis/sort.py="E72360CE"
14 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/analysis/string.Rmd="C349C034"
15 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/analysis/summary.Rmd="8B6077AB"
16 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/analysis/tanxin.Rmd="8EAE5B20"
17 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/analysis/动态规划问题.html="56B60A73"
18 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/dandiao_stack.Rmd="6247395D"
19 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/erchashu.Rmd="3D5BB80E"
20 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/leetcode_hot.Rmd="D26671FD"
21 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/queue_and_stack.Rmd="7749EB00"
22 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/slide_window.Rmd="6B0866AD"
23 | A:/Gaowenxin_notes/leetcode/leetcode-cookbook/tree.Rmd="DE7086FA"
24 | A:/Lijiaxiang/learn_credit_risk/learning_notes.Rmd="306801AC"
25 | A:/Lijiaxiang/usd-dea/dev_history_r_proj.R="3BDE22BA"
26 | 


--------------------------------------------------------------------------------
/analysis/sort.py:
--------------------------------------------------------------------------------
  1 | # -*- coding: utf-8 -*-
  2 | # @Time    : 2020/7/25 13:27
  3 | # @Author  : wenxin Gao
  4 | # @Email   : unique.gaowenxin@foxmail.com
  5 | # @File    : sort.py
  6 | # @Software: PyCharm
  7 | 
  8 | # 排序问题
  9 | 
 10 | 
 11 | 
 12 | 
 13 | '''
 14 | 冒泡排序算法
 15 | 时间复杂度为$o^n$
 16 | '''
 17 | 
 18 | arr=[91,9,8,7,6,78,5,4,3,2,1]
 19 | 
 20 | # def bub(arr):
 21 | #     for i in range(1,len(arr)):
 22 | #         for j in range(0,len(arr)-i):
 23 | #             if arr[j]>arr[j+1]:
 24 | #                 arr[j+1],arr[j]=arr[j],arr[j+1]
 25 | #     return arr
 26 | # l=bub(arr)
 27 | # print(l)
 28 | 
 29 | 
 30 | 
 31 | 
 32 | 目前来看两种写法是一样的
 33 | 
 34 | '''
 35 | 
 36 | 
 37 | '''
 38 | 
 39 | 
 40 | '''
 41 | 
 42 | 
 43 | '''
 44 | 归并排序
 45 | 
 46 | 采用分治之的方法进行排序，因此时间复杂度是nlog(n)
 47 | 
 48 | 步骤
 49 | 
 50 | 申请空间，使其大小为两个已经排序序列之和，该空间用来存放合并后的序列；
 51 | 
 52 | 设定两个指针，最初位置分别为两个已经排序序列的起始位置；
 53 | 
 54 | 比较两个指针所指向的元素，选择相对小的元素放入到合并空间，并移动指针到下一位置；
 55 | 
 56 | 重复步骤 3 直到某一指针达到序列尾；
 57 | 
 58 | 将另一序列剩下的所有元素直接复制到合并序列尾
 59 | 
 60 | '''
 61 | 
 62 | def mergeSort(arr):
 63 |     import math
 64 |     if(len(arr)<2):
 65 |         return arr
 66 |     middle = math.floor(len(arr)/2)
 67 |     left, right = arr[0:middle], arr[middle:]
 68 |     return merge(mergeSort(left), mergeSort(right))
 69 | 
 70 | def merge(left,right):
 71 |     result = []
 72 |     while left and right:
 73 |         if left[0] <= right[0]:
 74 |             result.append(left.pop(0)); #还是要理解这个思想
 75 |         else:
 76 |             result.append(right.pop(0));
 77 |     while left:
 78 |         result.append(left.pop(0));
 79 |     while right:
 80 |         result.append(right.pop(0));
 81 |     return result
 82 | 
 83 | 
 84 | 
 85 | 
 86 | 
 87 | '''
 88 | 快速排序
 89 | 
 90 | 在平均状况下，排序 n 个项目要 Ο(nlogn) 次比较。在最坏状况下则需要 Ο(n2) 次比较，但这种状况并不常见。事实上，快速排序通常明显比其他 Ο(nlogn) 算法更快，因为它的内部循环（inner loop）可以在大部分的架构上很有效率地被实现出来。
 91 | 
 92 | 快速排序使用分治法（Divide and conquer）策略来把一个串行（list）分为两个子串行（sub-lists）。
 93 | '''
 94 | 
 95 | 
 96 | def quickSort(arr, left=None, right=None):
 97 |     left = 0 if not isinstance(left,(int, float)) else left
 98 |     right = len(arr)-1 if not isinstance(right,(int, float)) else right
 99 |     if left < right:
100 |         partitionIndex = partition(arr, left, right)
101 |         quickSort(arr, left, partitionIndex-1)
102 |         quickSort(arr, partitionIndex+1, right)
103 |     return arr
104 | 
105 | def partition(arr, left, right):
106 |     pivot = left
107 |     index = pivot+1
108 |     i = index
109 |     while  i <= right:
110 |         if arr[i] < arr[pivot]:
111 |             swap(arr, i, index)
112 |             index+=1
113 |         i+=1
114 |     swap(arr,pivot,index-1)
115 |     return index-1
116 | 
117 | def swap(arr, i, j):
118 |     arr[i], arr[j] = arr[j], arr[i]
119 | 
120 | 
121 | 
122 | '''
123 | 


--------------------------------------------------------------------------------
/libs/pagedtable-1.1/css/pagedtable.css:
--------------------------------------------------------------------------------
  1 | .pagedtable {
  2 |   overflow: auto;
  3 |   padding-left: 8px;
  4 |   padding-right: 8px;
  5 | }
  6 | 
  7 | .pagedtable-wrapper {
  8 |   border: 1px solid #ccc;
  9 |   border-radius: 4px;
 10 |   margin-bottom: 10px;
 11 | }
 12 | 
 13 | .pagedtable table {
 14 |   width: 100%;
 15 |   max-width: 100%;
 16 |   margin: 0;
 17 | }
 18 | 
 19 | .pagedtable th {
 20 |   padding: 0 5px 0 5px;
 21 |   border: none;
 22 |   border-bottom: 2px solid #dddddd;
 23 | 
 24 |   min-width: 45px;
 25 | }
 26 | 
 27 | .pagedtable-empty th {
 28 |   display: none;
 29 | }
 30 | 
 31 | .pagedtable td {
 32 |   padding: 0 4px 0 4px;
 33 | }
 34 | 
 35 | .pagedtable .even {
 36 |   background-color: rgba(140, 140, 140, 0.1);
 37 | }
 38 | 
 39 | .pagedtable-padding-col {
 40 |   display: none;
 41 | }
 42 | 
 43 | .pagedtable a {
 44 |   -webkit-touch-callout: none;
 45 |   -webkit-user-select: none;
 46 |   -khtml-user-select: none;
 47 |   -moz-user-select: none;
 48 |   -ms-user-select: none;
 49 |   user-select: none;
 50 | }
 51 | 
 52 | .pagedtable-index-nav {
 53 |   cursor: pointer;
 54 |   padding: 0 5px 0 5px;
 55 |   float: right;
 56 |   border: 0;
 57 | }
 58 | 
 59 | .pagedtable-index-nav-disabled {
 60 |   cursor: default;
 61 |   text-decoration: none;
 62 |   color: #999;
 63 | }
 64 | 
 65 | a.pagedtable-index-nav-disabled:hover {
 66 |   text-decoration: none;
 67 |   color: #999;
 68 | }
 69 | 
 70 | .pagedtable-indexes {
 71 |   cursor: pointer;
 72 |   float: right;
 73 |   border: 0;
 74 | }
 75 | 
 76 | .pagedtable-index-current {
 77 |   cursor: default;
 78 |   text-decoration: none;
 79 |   font-weight: bold;
 80 |   color: #333;
 81 |   border: 0;
 82 | }
 83 | 
 84 | a.pagedtable-index-current:hover {
 85 |   text-decoration: none;
 86 |   font-weight: bold;
 87 |   color: #333;
 88 | }
 89 | 
 90 | .pagedtable-index {
 91 |   width: 30px;
 92 |   display: inline-block;
 93 |   text-align: center;
 94 |   border: 0;
 95 | }
 96 | 
 97 | .pagedtable-index-separator-left {
 98 |   display: inline-block;
 99 |   color: #333;
100 |   font-size: 9px;
101 |   padding: 0 0 0 0;
102 |   cursor: default;
103 | }
104 | 
105 | .pagedtable-index-separator-right {
106 |   display: inline-block;
107 |   color: #333;
108 |   font-size: 9px;
109 |   padding: 0 4px 0 0;
110 |   cursor: default;
111 | }
112 | 
113 | .pagedtable-footer {
114 |   padding-top: 4px;
115 |   padding-bottom: 5px;
116 | }
117 | 
118 | .pagedtable-not-empty .pagedtable-footer {
119 |   border-top: 2px solid #dddddd;
120 | }
121 | 
122 | .pagedtable-info {
123 |   overflow: hidden;
124 |   color: #999;
125 |   white-space: nowrap;
126 |   text-overflow: ellipsis;
127 | }
128 | 
129 | .pagedtable-header-name {
130 |   overflow: hidden;
131 |   text-overflow: ellipsis;
132 | }
133 | 
134 | .pagedtable-header-type {
135 |   color: #999;
136 |   font-weight: 400;
137 | }
138 | 
139 | .pagedtable-na-cell {
140 |   font-style: italic;
141 |   opacity: 0.3;
142 | }
143 | 


--------------------------------------------------------------------------------
/libs/gitbook-2.6.7/css/plugin-bookdown.css:
--------------------------------------------------------------------------------
  1 | .book .book-header h1 {
  2 |   padding-left: 20px;
  3 |   padding-right: 20px;
  4 | }
  5 | .book .book-header.fixed {
  6 |   position: fixed;
  7 |   right: 0;
  8 |   top: 0;
  9 |   left: 0;
 10 |   border-bottom: 1px solid rgba(0,0,0,.07);
 11 | }
 12 | span.search-highlight {
 13 |   background-color: #ffff88;
 14 | }
 15 | @media (min-width: 600px) {
 16 |   .book.with-summary .book-header.fixed {
 17 |     left: 300px;
 18 |   }
 19 | }
 20 | @media (max-width: 1240px) {
 21 |   .book .book-body.fixed {
 22 |     top: 50px;
 23 |   }
 24 |   .book .book-body.fixed .body-inner {
 25 |     top: auto;
 26 |   }
 27 | }
 28 | @media (max-width: 600px) {
 29 |   .book.with-summary .book-header.fixed {
 30 |     left: calc(100% - 60px);
 31 |     min-width: 300px;
 32 |   }
 33 |   .book.with-summary .book-body {
 34 |     transform: none;
 35 |     left: calc(100% - 60px);
 36 |     min-width: 300px;
 37 |   }
 38 |   .book .book-body.fixed {
 39 |     top: 0;
 40 |   }
 41 | }
 42 | 
 43 | .book .book-body.fixed .body-inner {
 44 |   top: 50px;
 45 | }
 46 | .book .book-body .page-wrapper .page-inner section.normal sub, .book .book-body .page-wrapper .page-inner section.normal sup {
 47 |   font-size: 85%;
 48 | }
 49 | 
 50 | @media print {
 51 |   .book .book-summary, .book .book-body .book-header, .fa {
 52 |     display: none !important;
 53 |   }
 54 |   .book .book-body.fixed {
 55 |     left: 0px;
 56 |   }
 57 |   .book .book-body,.book .book-body .body-inner, .book.with-summary {
 58 |     overflow: visible !important;
 59 |   }
 60 | }
 61 | .kable_wrapper {
 62 |   border-spacing: 20px 0;
 63 |   border-collapse: separate;
 64 |   border: none;
 65 |   margin: auto;
 66 | }
 67 | .kable_wrapper > tbody > tr > td {
 68 |   vertical-align: top;
 69 | }
 70 | .book .book-body .page-wrapper .page-inner section.normal table tr.header {
 71 |   border-top-width: 2px;
 72 | }
 73 | .book .book-body .page-wrapper .page-inner section.normal table tr:last-child td {
 74 |   border-bottom-width: 2px;
 75 | }
 76 | .book .book-body .page-wrapper .page-inner section.normal table td, .book .book-body .page-wrapper .page-inner section.normal table th {
 77 |   border-left: none;
 78 |   border-right: none;
 79 | }
 80 | .book .book-body .page-wrapper .page-inner section.normal table.kable_wrapper > tbody > tr, .book .book-body .page-wrapper .page-inner section.normal table.kable_wrapper > tbody > tr > td {
 81 |   border-top: none;
 82 | }
 83 | .book .book-body .page-wrapper .page-inner section.normal table.kable_wrapper > tbody > tr:last-child > td {
 84 |     border-bottom: none;
 85 | }
 86 | 
 87 | div.theorem, div.lemma, div.corollary, div.proposition, div.conjecture {
 88 |   font-style: italic;
 89 | }
 90 | span.theorem, span.lemma, span.corollary, span.proposition, span.conjecture {
 91 |   font-style: normal;
 92 | }
 93 | div.proof:after {
 94 |   content: "\25a2";
 95 |   float: right;
 96 | }
 97 | .header-section-number {
 98 |   padding-right: .5em;
 99 | }
100 | 


--------------------------------------------------------------------------------
/analysis/libs/gitbook-2.6.7/css/plugin-bookdown.css:
--------------------------------------------------------------------------------
  1 | .book .book-header h1 {
  2 |   padding-left: 20px;
  3 |   padding-right: 20px;
  4 | }
  5 | .book .book-header.fixed {
  6 |   position: fixed;
  7 |   right: 0;
  8 |   top: 0;
  9 |   left: 0;
 10 |   border-bottom: 1px solid rgba(0,0,0,.07);
 11 | }
 12 | span.search-highlight {
 13 |   background-color: #ffff88;
 14 | }
 15 | @media (min-width: 600px) {
 16 |   .book.with-summary .book-header.fixed {
 17 |     left: 300px;
 18 |   }
 19 | }
 20 | @media (max-width: 1240px) {
 21 |   .book .book-body.fixed {
 22 |     top: 50px;
 23 |   }
 24 |   .book .book-body.fixed .body-inner {
 25 |     top: auto;
 26 |   }
 27 | }
 28 | @media (max-width: 600px) {
 29 |   .book.with-summary .book-header.fixed {
 30 |     left: calc(100% - 60px);
 31 |     min-width: 300px;
 32 |   }
 33 |   .book.with-summary .book-body {
 34 |     transform: none;
 35 |     left: calc(100% - 60px);
 36 |     min-width: 300px;
 37 |   }
 38 |   .book .book-body.fixed {
 39 |     top: 0;
 40 |   }
 41 | }
 42 | 
 43 | .book .book-body.fixed .body-inner {
 44 |   top: 50px;
 45 | }
 46 | .book .book-body .page-wrapper .page-inner section.normal sub, .book .book-body .page-wrapper .page-inner section.normal sup {
 47 |   font-size: 85%;
 48 | }
 49 | 
 50 | @media print {
 51 |   .book .book-summary, .book .book-body .book-header, .fa {
 52 |     display: none !important;
 53 |   }
 54 |   .book .book-body.fixed {
 55 |     left: 0px;
 56 |   }
 57 |   .book .book-body,.book .book-body .body-inner, .book.with-summary {
 58 |     overflow: visible !important;
 59 |   }
 60 | }
 61 | .kable_wrapper {
 62 |   border-spacing: 20px 0;
 63 |   border-collapse: separate;
 64 |   border: none;
 65 |   margin: auto;
 66 | }
 67 | .kable_wrapper > tbody > tr > td {
 68 |   vertical-align: top;
 69 | }
 70 | .book .book-body .page-wrapper .page-inner section.normal table tr.header {
 71 |   border-top-width: 2px;
 72 | }
 73 | .book .book-body .page-wrapper .page-inner section.normal table tr:last-child td {
 74 |   border-bottom-width: 2px;
 75 | }
 76 | .book .book-body .page-wrapper .page-inner section.normal table td, .book .book-body .page-wrapper .page-inner section.normal table th {
 77 |   border-left: none;
 78 |   border-right: none;
 79 | }
 80 | .book .book-body .page-wrapper .page-inner section.normal table.kable_wrapper > tbody > tr, .book .book-body .page-wrapper .page-inner section.normal table.kable_wrapper > tbody > tr > td {
 81 |   border-top: none;
 82 | }
 83 | .book .book-body .page-wrapper .page-inner section.normal table.kable_wrapper > tbody > tr:last-child > td {
 84 |     border-bottom: none;
 85 | }
 86 | 
 87 | div.theorem, div.lemma, div.corollary, div.proposition, div.conjecture {
 88 |   font-style: italic;
 89 | }
 90 | span.theorem, span.lemma, span.corollary, span.proposition, span.conjecture {
 91 |   font-style: normal;
 92 | }
 93 | div.proof:after {
 94 |   content: "\25a2";
 95 |   float: right;
 96 | }
 97 | .header-section-number {
 98 |   padding-right: .5em;
 99 | }
100 | 


--------------------------------------------------------------------------------
/libs/gitbook-2.6.7/js/jquery.highlight.js:
--------------------------------------------------------------------------------
 1 | gitbook.require(["jQuery"], function(jQuery) {
 2 | 
 3 | /*
 4 |  * jQuery Highlight plugin
 5 |  *
 6 |  * Based on highlight v3 by Johann Burkard
 7 |  * http://johannburkard.de/blog/programming/javascript/highlight-javascript-text-higlighting-jquery-plugin.html
 8 |  *
 9 |  * Code a little bit refactored and cleaned (in my humble opinion).
10 |  * Most important changes:
11 |  *  - has an option to highlight only entire words (wordsOnly - false by default),
12 |  *  - has an option to be case sensitive (caseSensitive - false by default)
13 |  *  - highlight element tag and class names can be specified in options
14 |  *
15 |  * Copyright (c) 2009 Bartek Szopka
16 |  *
17 |  * Licensed under MIT license.
18 |  *
19 |  */
20 | 
21 | jQuery.extend({
22 |     highlight: function (node, re, nodeName, className) {
23 |         if (node.nodeType === 3) {
24 |             var match = node.data.match(re);
25 |             if (match) {
26 |                 var highlight = document.createElement(nodeName || 'span');
27 |                 highlight.className = className || 'highlight';
28 |                 var wordNode = node.splitText(match.index);
29 |                 wordNode.splitText(match[0].length);
30 |                 var wordClone = wordNode.cloneNode(true);
31 |                 highlight.appendChild(wordClone);
32 |                 wordNode.parentNode.replaceChild(highlight, wordNode);
33 |                 return 1; //skip added node in parent
34 |             }
35 |         } else if ((node.nodeType === 1 && node.childNodes) && // only element nodes that have children
36 |                 !/(script|style)/i.test(node.tagName) && // ignore script and style nodes
37 |                 !(node.tagName === nodeName.toUpperCase() && node.className === className)) { // skip if already highlighted
38 |             for (var i = 0; i < node.childNodes.length; i++) {
39 |                 i += jQuery.highlight(node.childNodes[i], re, nodeName, className);
40 |             }
41 |         }
42 |         return 0;
43 |     }
44 | });
45 | 
46 | jQuery.fn.unhighlight = function (options) {
47 |     var settings = { className: 'highlight', element: 'span' };
48 |     jQuery.extend(settings, options);
49 | 
50 |     return this.find(settings.element + "." + settings.className).each(function () {
51 |         var parent = this.parentNode;
52 |         parent.replaceChild(this.firstChild, this);
53 |         parent.normalize();
54 |     }).end();
55 | };
56 | 
57 | jQuery.fn.highlight = function (words, options) {
58 |     var settings = { className: 'highlight', element: 'span', caseSensitive: false, wordsOnly: false };
59 |     jQuery.extend(settings, options);
60 | 
61 |     if (words.constructor === String) {
62 |         words = [words];
63 |         // also match 'foo-bar' if search for 'foo bar'
64 |         if (/\s/.test(words[0])) words.push(words[0].replace(/\s+/, '-'));
65 |     }
66 |     words = jQuery.grep(words, function(word, i){
67 |       return word !== '';
68 |     });
69 |     words = jQuery.map(words, function(word, i) {
70 |       return word.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, "\\$&");
71 |     });
72 |     if (words.length === 0) { return this; }
73 | 
74 |     var flag = settings.caseSensitive ? "" : "i";
75 |     var pattern = "(" + words.join("|") + ")";
76 |     if (settings.wordsOnly) {
77 |         pattern = "\\b" + pattern + "\\b";
78 |     }
79 |     var re = new RegExp(pattern, flag);
80 | 
81 |     return this.each(function () {
82 |         jQuery.highlight(this, re, settings.element, settings.className);
83 |     });
84 | };
85 | 
86 | });
87 | 


--------------------------------------------------------------------------------
/analysis/libs/gitbook-2.6.7/js/jquery.highlight.js:
--------------------------------------------------------------------------------
 1 | gitbook.require(["jQuery"], function(jQuery) {
 2 | 
 3 | /*
 4 |  * jQuery Highlight plugin
 5 |  *
 6 |  * Based on highlight v3 by Johann Burkard
 7 |  * http://johannburkard.de/blog/programming/javascript/highlight-javascript-text-higlighting-jquery-plugin.html
 8 |  *
 9 |  * Code a little bit refactored and cleaned (in my humble opinion).
10 |  * Most important changes:
11 |  *  - has an option to highlight only entire words (wordsOnly - false by default),
12 |  *  - has an option to be case sensitive (caseSensitive - false by default)
13 |  *  - highlight element tag and class names can be specified in options
14 |  *
15 |  * Copyright (c) 2009 Bartek Szopka
16 |  *
17 |  * Licensed under MIT license.
18 |  *
19 |  */
20 | 
21 | jQuery.extend({
22 |     highlight: function (node, re, nodeName, className) {
23 |         if (node.nodeType === 3) {
24 |             var match = node.data.match(re);
25 |             if (match) {
26 |                 var highlight = document.createElement(nodeName || 'span');
27 |                 highlight.className = className || 'highlight';
28 |                 var wordNode = node.splitText(match.index);
29 |                 wordNode.splitText(match[0].length);
30 |                 var wordClone = wordNode.cloneNode(true);
31 |                 highlight.appendChild(wordClone);
32 |                 wordNode.parentNode.replaceChild(highlight, wordNode);
33 |                 return 1; //skip added node in parent
34 |             }
35 |         } else if ((node.nodeType === 1 && node.childNodes) && // only element nodes that have children
36 |                 !/(script|style)/i.test(node.tagName) && // ignore script and style nodes
37 |                 !(node.tagName === nodeName.toUpperCase() && node.className === className)) { // skip if already highlighted
38 |             for (var i = 0; i < node.childNodes.length; i++) {
39 |                 i += jQuery.highlight(node.childNodes[i], re, nodeName, className);
40 |             }
41 |         }
42 |         return 0;
43 |     }
44 | });
45 | 
46 | jQuery.fn.unhighlight = function (options) {
47 |     var settings = { className: 'highlight', element: 'span' };
48 |     jQuery.extend(settings, options);
49 | 
50 |     return this.find(settings.element + "." + settings.className).each(function () {
51 |         var parent = this.parentNode;
52 |         parent.replaceChild(this.firstChild, this);
53 |         parent.normalize();
54 |     }).end();
55 | };
56 | 
57 | jQuery.fn.highlight = function (words, options) {
58 |     var settings = { className: 'highlight', element: 'span', caseSensitive: false, wordsOnly: false };
59 |     jQuery.extend(settings, options);
60 | 
61 |     if (words.constructor === String) {
62 |         words = [words];
63 |         // also match 'foo-bar' if search for 'foo bar'
64 |         if (/\s/.test(words[0])) words.push(words[0].replace(/\s+/, '-'));
65 |     }
66 |     words = jQuery.grep(words, function(word, i){
67 |       return word !== '';
68 |     });
69 |     words = jQuery.map(words, function(word, i) {
70 |       return word.replace(/[-[\]{}()*+?.,\\^$|#\s]/g, "\\$&");
71 |     });
72 |     if (words.length === 0) { return this; }
73 | 
74 |     var flag = settings.caseSensitive ? "" : "i";
75 |     var pattern = "(" + words.join("|") + ")";
76 |     if (settings.wordsOnly) {
77 |         pattern = "\\b" + pattern + "\\b";
78 |     }
79 |     var re = new RegExp(pattern, flag);
80 | 
81 |     return this.each(function () {
82 |         jQuery.highlight(this, re, settings.element, settings.className);
83 |     });
84 | };
85 | 
86 | });
87 | 


--------------------------------------------------------------------------------
/analysis/base_kg.Rmd:
--------------------------------------------------------------------------------
  1 | # 基础结构
  2 | 
  3 | ## stack
  4 | 
  5 | 后进先出，删除与加入均在**栈顶操作**
  6 | 
  7 | 栈也称为堆栈，是一种**线性表**。
  8 | 
  9 | 堆栈的特性： 最先放入堆栈中的内容最后被拿出来，最后放入堆栈中的内容最先被拿出来， 被称为先进后出、后进先出。
 10 | 
 11 | 堆栈中两个最重要的操作是PUSH和POP，两个是相反的操作。
 12 | 
 13 | PUSH：在堆栈的顶部加入一个元素。
 14 | 
 15 | POP：在堆栈顶部移去一个元素， 并将堆栈的大小减一。
 16 | 具体参考[「大羚羊」](https://blog.csdn.net/m0_37622530/article/details/81429837)
 17 | 
 18 | ![](../figs/base_kg_1.png)
 19 | 
 20 | ## queue
 21 | 
 22 | 
 23 | 队列——先进先出
 24 | 
 25 | 队列也是一种特殊的线性表。不同于栈所服从的先进后出的原则，队列的原则是先进先出。
 26 | 
 27 | 队列在队头做删除操作,在队尾做插入操作：
 28 | 
 29 | ![](../figs/base_kg_2.jpg)
 30 | 
 31 | **我一直在想怎么可以把两种数据结构不记混，后来发现，画个图！**其次是“每日一遍，神清气爽~”
 32 | 
 33 | ![](../figs/base_kg_3.png)
 34 | 
 35 | 主要考题：深度优先搜索和广度优先搜索（二叉树的层序遍历，先、中、后序遍历等）
 36 | 
 37 | ### 数组实现栈
 38 | 
 39 | ```r
 40 | 
 41 | class Stack:
 42 |     def __init__(self, array = None):
 43 |         super().__init__()
 44 |         self.array = array
 45 | 
 46 |     # 入栈
 47 |     def push(self, x):
 48 |         self.array.append(x)
 49 | 
 50 |     # 出栈
 51 |     def pop(self,):
 52 |         if len(self.array) == 0:
 53 |             return
 54 | 
 55 |         return self.array.pop()
 56 | 
 57 |     # 取栈顶元素
 58 |     def top(self,):
 59 |         if len(self.array) == 0:
 60 |             return
 61 | 
 62 |         return self.array[-1]
 63 | 
 64 |     # 判空
 65 |     def isEmpty(self,):
 66 |         return True if self.array == [] else False
 67 | 
 68 | ```
 69 | 
 70 | ### 数组实现队列
 71 | 
 72 | ```r
 73 | class Queue:
 74 |     def __init__(self, array = None):
 75 |         super().__init__()
 76 |         self.array = array
 77 | 
 78 |     # 入队
 79 |     def enqueue(self, x):
 80 |         self.array.append(x)
 81 | 
 82 |     # 出队
 83 |     def dequeue(self):
 84 |         if len(self.array) == 0:
 85 |             return
 86 | 
 87 |         return self.array.pop(0)
 88 | 
 89 |     # 判空
 90 |     def isEmpty(self,):
 91 |         return True if self.array == [] else False
 92 | 
 93 | 
 94 | 
 95 | ```
 96 | 
 97 | ## 链表
 98 | 
 99 | ### 单向链表
100 | 
101 | >线性的顺序存储数据，而是在每一个节点里存到下一个节点的指针(Pointer)。由于不必须按顺序存储，链表的插入和删除操作可以达到O(1)的复杂度。
102 | 
103 | 链表带指针~链表带指真~链表带指针~重要的事情说三遍！
104 | 
105 | 
106 | 循环链表是痛点！感觉链表题大部分也是画图，记得使用中间变量
107 | 
108 | >链表是一种物理存储单元上非连续、非顺序的存储结构，数据元素的逻辑顺序是通过链表中的指针链接次序实现的。链表由一系列结点（链表中每一个元素称为结点）组成，结点可以在运行时动态生成。每个结点包括两个部分：一个是存储数据元素的数据域，另一个是存储下一个结点地址的指针域。 相比于线性表顺序结构，操作复杂。由于不必须按顺序存储，链表在插入的时候可以达到O(1)的复杂度，比另一种线性表顺序表快得多，但是查找一个节点或者访问特定编号的节点则需要O(n)的时间，而线性表和顺序表相应的时间复杂度分别是O(logn)和O(1)。
109 | 使用链表结构可以克服数组链表需要预先知道数据大小的缺点，链表结构可以充分利用计算机内存空间，实现灵活的内存动态管理。但是链表失去了数组随机读取的优点，同时链表由于增加了结点的指针域，空间开销比较大。链表最明显的好处就是，常规数组排列关联项目的方式可能不同于这些数据项目在记忆体或磁盘上顺序，数据的存取往往要在不同的排列顺序中转换。链表允许插入和移除表上任意位置上的节点，但是不允许随机存取。链表有很多种不同的类型：单向链表，双向链表以及循环链表。链表可以在多种编程语言中实现。像Lisp和Scheme这样的语言的内建数据类型中就包含了链表的存取和操作[百度百科](https://baike.baidu.com/item/%E9%93%BE%E8%A1%A8/9794473?fr=aladdin)
110 | 
111 | 做插入和删除操作的时候是链表更快，但是做查找的话，链表不如数组等顺序存储结构。
112 | 
113 | 每个链表开头节点所带的指针叫head：头指针
114 | 
115 | ![](../figs/lianbiao_1.png)
116 | 
117 | 除了单项链表还有双向和循环链表
118 | 
119 | ### 双向链表
120 | 
121 | >双向链表也叫双链表，是链表的一种，它的每个数据结点中都有两个指针，分别指向直接后继和直接前驱。所以，从双向链表中的任意一个结点开始，都可以很方便地访问它的前驱结点和后继结点。一般我们都构造双向循环链表。[baike]https://baike.baidu.com/item/%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8/2968731?fr=aladdin)
122 | 
123 | ![](../figs/lianbiao_2.png)
124 | ### 循环链表
125 | 
126 | >表尾结点的next指针指向头结点
127 | 
128 | ![](../figs/lianbiao_3.png)
129 | 
130 | 
131 | ## array
132 | 
133 | 数组是用于储存多个相同类型数据的集合。
134 | 
135 | ### 一维数组
136 | 
137 | 
138 | 
139 | ### 二维数组
140 | 
141 | ## tree
142 | 
143 | ## 递归的思想
144 | 
145 | 感觉大部分问题，应该是可以通过递归来解决的，但是理解起来总归是需要一段时间的.
146 | 
147 | 遇到问题不用着急,先写出递推的逻辑,然后写出递归的终止条件
148 | 


--------------------------------------------------------------------------------
/analysis/k-num-sum.Rmd:
--------------------------------------------------------------------------------
  1 | ## 哈希表
  2 | 
  3 | python中的字典的原理
  4 | 
  5 | 
  6 | 
  7 | **前缀**
  8 | 
  9 | 使用前缀数组的一大好处是可用 pre(b) - pre(a-1) 来表示 a->b 中这段中数组的和。这个 a-1 可以不用那么纠结。重点理解思想。
 10 | 
 11 | 比如 前5项的和 - 前3项的和 = 第4项~第5项的和。 (1+2+3+4+5) - (1+2+3) = 4+5
 12 | 
 13 | 这个前缀和数组 preSum 的含义也很好理解，preSum[i] 就是 nums[0..i-1] 的和。那么如果我们想求 nums[i..j] 的和，只需要一步操作 preSum[j+1]-preSum[i] 即可，而不需要重新去遍历数组了。
 14 | 
 15 | ### K数之和
 16 | 
 17 | 给定一个整数数组和一个整数 k，你需要找到该数组中和为 k 的连续的子数组的个数。
 18 | 
 19 | 示例 1 :
 20 | 
 21 | 输入:nums = [1,1,1], k = 2
 22 | 输出: 2 , [1,1] 与 [1,1] 为两种不同的情况。
 23 | 说明 :
 24 | 
 25 | 数组的长度为 [1, 20,000]。
 26 | 数组中元素的范围是 [-1000, 1000] ，且整数 k 的范围是 [-1e7, 1e7]。
 27 | 
 28 | 
 29 | 
 30 | 这道题刚开始想到的思路是，先利用dp数组存放前i个数的和（前缀和），然后遍历这个数组，对于每个元素，求出dp[i]+k在dp[i:]的存在个数，即为以i+1开头的符合条件的子数组的个数，遍历结束把每个点的个数加在一起，即为答案。
 31 | 
 32 | 分析可知，这种方法除了开始生成dp遍历了一次数组，在后面使用了双层循环，时间复杂度O(N^2)，空间复杂度O(N)。
 33 | 
 34 | 这种方法可以通过，但是耗时太多，那么，如果对时间复杂度进行优化呢。
 35 | 
 36 | ==
 37 | 
 38 | 使用哈希表（Python中字典原理）即可。抛弃dp数组，**只使用一个变量pre来保存当前位置的前缀和，使用一个字典dp，它的key是前缀和的值，对应的value表示这个前缀和出现的次数。**
 39 | 
 40 | 在元素累加的过程中得到sum[j]=nums[0]+nums[1]+···+nums[j]，并放入哈希表中。如果我们可以在哈希表中发现之前存在着sum[i]使得sum[j]-sum[i]=k，那么也就说明了有一个子序列之和为 k。时间复杂度终于被降到了$O(n)$。
 41 | 
 42 | 首先添加dp[0] = 1，表示前缀和为0的情况出现了一次(这是为了考虑从i=0开始的答案)，之后遍历数组，计算前缀和pre，加入dp（要判断pre是否存在，不存在写入，存在dp[pre]+=1)，同时判断pre-k是否在dp字典中，如果在，ans+=dp[pre-k]，说明存在dp[pre-k]种答案。最后返回ans即可。
 43 | 
 44 | 。
 45 | 这种情况只遍历了一次数组，字典中找值的过程时间复杂度O(1)，所以总的时间复杂度O(N)，只用到了一个变量和字典，空间复杂度O(N)。
 46 | 
 47 | ```r
 48 | class Solution:
 49 |     def subarraySum(self, nums: List[int], k: int) -> int:
 50 |         n = len(nums)
 51 |         pre = 0 #前缀和
 52 |         ans = 0
 53 |         dp = dict() #存放 前缀和:出现次数，键值对，初始化一个0:1，为了考虑到从头开始到某点的子数组正好为答案。
 54 |         dp[0] = 1
 55 |         for i in range(n):
 56 |             pre += nums[i] #计算前缀和
 57 |             if pre-k in dp: #如果pre-k这个前缀存在，那么答案加上它出现的次数
 58 |                 ans += dp[pre-k]
 59 |             if pre in dp: #更新dp[pre]
 60 |                 dp[pre] += 1
 61 |             else:
 62 |                 dp[pre] = 1
 63 |         return ans
 64 | ```
 65 | 
 66 | ## 贪心算法
 67 | 
 68 | ### 跳跃游戏
 69 | 
 70 | 给定一个非负整数数组，你最初位于数组的第一个位置。
 71 | 
 72 | 数组中的每个元素代表你在该位置可以跳跃的最大长度。
 73 | 
 74 | 判断你是否能够到达最后一个位置。
 75 | 
 76 | 示例 1:
 77 | 
 78 | 输入: [2,3,1,1,4]
 79 | 输出: true
 80 | 解释: 我们可以先跳 1 步，从位置 0 到达 位置 1, 然后再从位置 1 跳 3 步到达最后一个位置。
 81 | 
 82 | 示例 2:
 83 | 
 84 | 输入: [3,2,1,0,4]
 85 | 输出: false
 86 | 解释: 无论怎样，你总会到达索引为 3 的位置。但该位置的最大跳跃长度是 0 ， 所以你永远不可能到达最后一个位置。
 87 | 
 88 | - 如果所有元素都不为0， 那么一定可以跳到最后；
 89 | - 从后往前开始想，如果这个节点能够达到，那么下一个节点只要大于等于1就行，如果这个节点不能达到那么那么期待下一个节点要大于等于能达到的距离
 90 | 
 91 | 可以用贪心的方法解决这个问题。
 92 | 
 93 | ![跳跃游戏](figs/跳跃游戏.png)
 94 | 
 95 | ```r
 96 | class Solution:
 97 |     def canJump(self, nums) :
 98 |         max_i = 0       #初始化当前能到达最远的位置
 99 |         for i, jump in enumerate(nums):   #i为当前位置，jump是当前位置的跳数
100 |             if max_i>=i and i+jump>max_i:  #如果当前位置能到达，并且当前位置+跳数>最远位置  
101 |                 max_i = i+jump  #更新最远能到达位置
102 |         return max_i>=i
103 | 
104 | ```
105 | ```r
106 | class Solution:
107 |     def canJump(self, nums):
108 |         """
109 |         :type nums: List[int]
110 |         :rtype: bool
111 |         """
112 |  
113 |         maxPos = 0
114 |         result = False
115 |         for i in range(len(nums)-1):
116 |             #如果历史最高高度达不到我们目前的index
117 |             if maxPos < i:
118 |                 return False
119 |             #更新历史最大值
120 |             maxPos = max(maxPos, nums[i] + i)
121 |             
122 |         #判断是否完全通过
123 |         if maxPos >= len(nums) - 1:
124 |             result = True
125 |             
126 |         return result
127 | ```
128 | 
129 | 时间复杂度：O(n)，其中 n 为数组的大小。只需要访问 nums 数组一遍，共n 个位置。
130 | 
131 | 空间复杂度：O(1)，不需要额外的空间开销。
132 | 
133 | >对于这种跳跃数组的问题，也就是要到达的位置与它的每一项关系紧密的问题，第一我们可以通过保存最大范围也就是历史最大index的方法去解决。第二，我们也可以尝试着用逆序去思考，看模拟每一步能不能走成功
134 | 


--------------------------------------------------------------------------------
/libs/gitbook-2.6.7/js/plugin-sharing.js:
--------------------------------------------------------------------------------
  1 | gitbook.require(["gitbook", "lodash", "jQuery"], function(gitbook, _, $) {
  2 |     var SITES = {
  3 |         'github': {
  4 |             'label': 'Github',
  5 |             'icon': 'fa fa-github',
  6 |             'onClick': function(e) {
  7 |                 e.preventDefault();
  8 |                 var repo = $('meta[name="github-repo"]').attr('content');
  9 |                 if (typeof repo === 'undefined') throw("Github repo not defined");
 10 |                 window.open("https://github.com/"+repo);
 11 |             }
 12 |         },
 13 |         'facebook': {
 14 |             'label': 'Facebook',
 15 |             'icon': 'fa fa-facebook',
 16 |             'onClick': function(e) {
 17 |                 e.preventDefault();
 18 |                 window.open("http://www.facebook.com/sharer/sharer.php?u="+encodeURIComponent(location.href));
 19 |             }
 20 |         },
 21 |         'twitter': {
 22 |             'label': 'Twitter',
 23 |             'icon': 'fa fa-twitter',
 24 |             'onClick': function(e) {
 25 |                 e.preventDefault();
 26 |                 window.open("http://twitter.com/intent/tweet?text="+document.title+"&url="+encodeURIComponent(location.href)+"&hashtags=rmarkdown,bookdown");
 27 |             }
 28 |         },
 29 |         'linkedin': {
 30 |             'label': 'LinkedIn',
 31 |             'icon': 'fa fa-linkedin',
 32 |             'onClick': function(e) {
 33 |                 e.preventDefault();
 34 |                 window.open("https://www.linkedin.com/shareArticle?mini=true&url="+encodeURIComponent(location.href)+"&title="+encodeURIComponent(document.title));
 35 |             }
 36 |         },
 37 |         'weibo': {
 38 |             'label': 'Weibo',
 39 |             'icon': 'fa fa-weibo',
 40 |             'onClick': function(e) {
 41 |                 e.preventDefault();
 42 |                 window.open("http://service.weibo.com/share/share.php?content=utf-8&url="+encodeURIComponent(location.href)+"&title="+encodeURIComponent(document.title));
 43 |             }
 44 |         },
 45 |         'instapaper': {
 46 |             'label': 'Instapaper',
 47 |             'icon': 'fa fa-italic',
 48 |             'onClick': function(e) {
 49 |                 e.preventDefault();
 50 |                 window.open("http://www.instapaper.com/text?u="+encodeURIComponent(location.href));
 51 |             }
 52 |         },
 53 |         'vk': {
 54 |             'label': 'VK',
 55 |             'icon': 'fa fa-vk',
 56 |             'onClick': function(e) {
 57 |                 e.preventDefault();
 58 |                 window.open("http://vkontakte.ru/share.php?url="+encodeURIComponent(location.href));
 59 |             }
 60 |         }
 61 |     };
 62 | 
 63 | 
 64 | 
 65 |     gitbook.events.bind("start", function(e, config) {
 66 |         var opts = config.sharing;
 67 |         if (!opts) return;
 68 | 
 69 |         // Create dropdown menu
 70 |         var menu = _.chain(opts.all)
 71 |             .map(function(id) {
 72 |                 var site = SITES[id];
 73 |                 if (!site) return;
 74 |                 return {
 75 |                     text: site.label,
 76 |                     onClick: site.onClick
 77 |                 };
 78 |             })
 79 |             .compact()
 80 |             .value();
 81 | 
 82 |         // Create main button with dropdown
 83 |         if (menu.length > 0) {
 84 |             gitbook.toolbar.createButton({
 85 |                 icon: 'fa fa-share-alt',
 86 |                 label: 'Share',
 87 |                 position: 'right',
 88 |                 dropdown: [menu]
 89 |             });
 90 |         }
 91 | 
 92 |         // Direct actions to share
 93 |         _.each(SITES, function(site, sideId) {
 94 |             if (!opts[sideId]) return;
 95 | 
 96 |             gitbook.toolbar.createButton({
 97 |                 icon: site.icon,
 98 |                 label: site.label,
 99 |                 title: site.label,
100 |                 position: 'right',
101 |                 onClick: site.onClick
102 |             });
103 |         });
104 |     });
105 | });
106 | 


--------------------------------------------------------------------------------
/analysis/libs/gitbook-2.6.7/js/plugin-sharing.js:
--------------------------------------------------------------------------------
  1 | gitbook.require(["gitbook", "lodash", "jQuery"], function(gitbook, _, $) {
  2 |     var SITES = {
  3 |         'github': {
  4 |             'label': 'Github',
  5 |             'icon': 'fa fa-github',
  6 |             'onClick': function(e) {
  7 |                 e.preventDefault();
  8 |                 var repo = $('meta[name="github-repo"]').attr('content');
  9 |                 if (typeof repo === 'undefined') throw("Github repo not defined");
 10 |                 window.open("https://github.com/"+repo);
 11 |             }
 12 |         },
 13 |         'facebook': {
 14 |             'label': 'Facebook',
 15 |             'icon': 'fa fa-facebook',
 16 |             'onClick': function(e) {
 17 |                 e.preventDefault();
 18 |                 window.open("http://www.facebook.com/sharer/sharer.php?u="+encodeURIComponent(location.href));
 19 |             }
 20 |         },
 21 |         'twitter': {
 22 |             'label': 'Twitter',
 23 |             'icon': 'fa fa-twitter',
 24 |             'onClick': function(e) {
 25 |                 e.preventDefault();
 26 |                 window.open("http://twitter.com/intent/tweet?text="+document.title+"&url="+encodeURIComponent(location.href)+"&hashtags=rmarkdown,bookdown");
 27 |             }
 28 |         },
 29 |         'linkedin': {
 30 |             'label': 'LinkedIn',
 31 |             'icon': 'fa fa-linkedin',
 32 |             'onClick': function(e) {
 33 |                 e.preventDefault();
 34 |                 window.open("https://www.linkedin.com/shareArticle?mini=true&url="+encodeURIComponent(location.href)+"&title="+encodeURIComponent(document.title));
 35 |             }
 36 |         },
 37 |         'weibo': {
 38 |             'label': 'Weibo',
 39 |             'icon': 'fa fa-weibo',
 40 |             'onClick': function(e) {
 41 |                 e.preventDefault();
 42 |                 window.open("http://service.weibo.com/share/share.php?content=utf-8&url="+encodeURIComponent(location.href)+"&title="+encodeURIComponent(document.title));
 43 |             }
 44 |         },
 45 |         'instapaper': {
 46 |             'label': 'Instapaper',
 47 |             'icon': 'fa fa-italic',
 48 |             'onClick': function(e) {
 49 |                 e.preventDefault();
 50 |                 window.open("http://www.instapaper.com/text?u="+encodeURIComponent(location.href));
 51 |             }
 52 |         },
 53 |         'vk': {
 54 |             'label': 'VK',
 55 |             'icon': 'fa fa-vk',
 56 |             'onClick': function(e) {
 57 |                 e.preventDefault();
 58 |                 window.open("http://vkontakte.ru/share.php?url="+encodeURIComponent(location.href));
 59 |             }
 60 |         }
 61 |     };
 62 | 
 63 | 
 64 | 
 65 |     gitbook.events.bind("start", function(e, config) {
 66 |         var opts = config.sharing;
 67 |         if (!opts) return;
 68 | 
 69 |         // Create dropdown menu
 70 |         var menu = _.chain(opts.all)
 71 |             .map(function(id) {
 72 |                 var site = SITES[id];
 73 |                 if (!site) return;
 74 |                 return {
 75 |                     text: site.label,
 76 |                     onClick: site.onClick
 77 |                 };
 78 |             })
 79 |             .compact()
 80 |             .value();
 81 | 
 82 |         // Create main button with dropdown
 83 |         if (menu.length > 0) {
 84 |             gitbook.toolbar.createButton({
 85 |                 icon: 'fa fa-share-alt',
 86 |                 label: 'Share',
 87 |                 position: 'right',
 88 |                 dropdown: [menu]
 89 |             });
 90 |         }
 91 | 
 92 |         // Direct actions to share
 93 |         _.each(SITES, function(site, sideId) {
 94 |             if (!opts[sideId]) return;
 95 | 
 96 |             gitbook.toolbar.createButton({
 97 |                 icon: site.icon,
 98 |                 label: site.label,
 99 |                 title: site.label,
100 |                 position: 'right',
101 |                 onClick: site.onClick
102 |             });
103 |         });
104 |     });
105 | });
106 | 


--------------------------------------------------------------------------------
/libs/gitbook-2.6.7/js/plugin-fontsettings.js:
--------------------------------------------------------------------------------
  1 | gitbook.require(["gitbook", "lodash", "jQuery"], function(gitbook, _, $) {
  2 |     var fontState;
  3 | 
  4 |     var THEMES = {
  5 |         "white": 0,
  6 |         "sepia": 1,
  7 |         "night": 2
  8 |     };
  9 | 
 10 |     var FAMILY = {
 11 |         "serif": 0,
 12 |         "sans": 1
 13 |     };
 14 | 
 15 |     // Save current font settings
 16 |     function saveFontSettings() {
 17 |         gitbook.storage.set("fontState", fontState);
 18 |         update();
 19 |     }
 20 | 
 21 |     // Increase font size
 22 |     function enlargeFontSize(e) {
 23 |         e.preventDefault();
 24 |         if (fontState.size >= 4) return;
 25 | 
 26 |         fontState.size++;
 27 |         saveFontSettings();
 28 |     };
 29 | 
 30 |     // Decrease font size
 31 |     function reduceFontSize(e) {
 32 |         e.preventDefault();
 33 |         if (fontState.size <= 0) return;
 34 | 
 35 |         fontState.size--;
 36 |         saveFontSettings();
 37 |     };
 38 | 
 39 |     // Change font family
 40 |     function changeFontFamily(index, e) {
 41 |         e.preventDefault();
 42 | 
 43 |         fontState.family = index;
 44 |         saveFontSettings();
 45 |     };
 46 | 
 47 |     // Change type of color
 48 |     function changeColorTheme(index, e) {
 49 |         e.preventDefault();
 50 | 
 51 |         var $book = $(".book");
 52 | 
 53 |         if (fontState.theme !== 0)
 54 |             $book.removeClass("color-theme-"+fontState.theme);
 55 | 
 56 |         fontState.theme = index;
 57 |         if (fontState.theme !== 0)
 58 |             $book.addClass("color-theme-"+fontState.theme);
 59 | 
 60 |         saveFontSettings();
 61 |     };
 62 | 
 63 |     function update() {
 64 |         var $book = gitbook.state.$book;
 65 | 
 66 |         $(".font-settings .font-family-list li").removeClass("active");
 67 |         $(".font-settings .font-family-list li:nth-child("+(fontState.family+1)+")").addClass("active");
 68 | 
 69 |         $book[0].className = $book[0].className.replace(/\bfont-\S+/g, '');
 70 |         $book.addClass("font-size-"+fontState.size);
 71 |         $book.addClass("font-family-"+fontState.family);
 72 | 
 73 |         if(fontState.theme !== 0) {
 74 |             $book[0].className = $book[0].className.replace(/\bcolor-theme-\S+/g, '');
 75 |             $book.addClass("color-theme-"+fontState.theme);
 76 |         }
 77 |     };
 78 | 
 79 |     function init(config) {
 80 |         var $bookBody, $book;
 81 | 
 82 |         //Find DOM elements.
 83 |         $book = gitbook.state.$book;
 84 |         $bookBody = $book.find(".book-body");
 85 | 
 86 |         // Instantiate font state object
 87 |         fontState = gitbook.storage.get("fontState", {
 88 |             size: config.size || 2,
 89 |             family: FAMILY[config.family || "sans"],
 90 |             theme: THEMES[config.theme || "white"]
 91 |         });
 92 | 
 93 |         update();
 94 |     };
 95 | 
 96 | 
 97 |     gitbook.events.bind("start", function(e, config) {
 98 |         var opts = config.fontsettings;
 99 |         if (!opts) return;
100 |         
101 |         // Create buttons in toolbar
102 |         gitbook.toolbar.createButton({
103 |             icon: 'fa fa-font',
104 |             label: 'Font Settings',
105 |             className: 'font-settings',
106 |             dropdown: [
107 |                 [
108 |                     {
109 |                         text: 'A',
110 |                         className: 'font-reduce',
111 |                         onClick: reduceFontSize
112 |                     },
113 |                     {
114 |                         text: 'A',
115 |                         className: 'font-enlarge',
116 |                         onClick: enlargeFontSize
117 |                     }
118 |                 ],
119 |                 [
120 |                     {
121 |                         text: 'Serif',
122 |                         onClick: _.partial(changeFontFamily, 0)
123 |                     },
124 |                     {
125 |                         text: 'Sans',
126 |                         onClick: _.partial(changeFontFamily, 1)
127 |                     }
128 |                 ],
129 |                 [
130 |                     {
131 |                         text: 'White',
132 |                         onClick: _.partial(changeColorTheme, 0)
133 |                     },
134 |                     {
135 |                         text: 'Sepia',
136 |                         onClick: _.partial(changeColorTheme, 1)
137 |                     },
138 |                     {
139 |                         text: 'Night',
140 |                         onClick: _.partial(changeColorTheme, 2)
141 |                     }
142 |                 ]
143 |             ]
144 |         });
145 | 
146 | 
147 |         // Init current settings
148 |         init(opts);
149 |     });
150 | });
151 | 
152 | 
153 | 


--------------------------------------------------------------------------------
/analysis/libs/gitbook-2.6.7/js/plugin-fontsettings.js:
--------------------------------------------------------------------------------
  1 | gitbook.require(["gitbook", "lodash", "jQuery"], function(gitbook, _, $) {
  2 |     var fontState;
  3 | 
  4 |     var THEMES = {
  5 |         "white": 0,
  6 |         "sepia": 1,
  7 |         "night": 2
  8 |     };
  9 | 
 10 |     var FAMILY = {
 11 |         "serif": 0,
 12 |         "sans": 1
 13 |     };
 14 | 
 15 |     // Save current font settings
 16 |     function saveFontSettings() {
 17 |         gitbook.storage.set("fontState", fontState);
 18 |         update();
 19 |     }
 20 | 
 21 |     // Increase font size
 22 |     function enlargeFontSize(e) {
 23 |         e.preventDefault();
 24 |         if (fontState.size >= 4) return;
 25 | 
 26 |         fontState.size++;
 27 |         saveFontSettings();
 28 |     };
 29 | 
 30 |     // Decrease font size
 31 |     function reduceFontSize(e) {
 32 |         e.preventDefault();
 33 |         if (fontState.size <= 0) return;
 34 | 
 35 |         fontState.size--;
 36 |         saveFontSettings();
 37 |     };
 38 | 
 39 |     // Change font family
 40 |     function changeFontFamily(index, e) {
 41 |         e.preventDefault();
 42 | 
 43 |         fontState.family = index;
 44 |         saveFontSettings();
 45 |     };
 46 | 
 47 |     // Change type of color
 48 |     function changeColorTheme(index, e) {
 49 |         e.preventDefault();
 50 | 
 51 |         var $book = $(".book");
 52 | 
 53 |         if (fontState.theme !== 0)
 54 |             $book.removeClass("color-theme-"+fontState.theme);
 55 | 
 56 |         fontState.theme = index;
 57 |         if (fontState.theme !== 0)
 58 |             $book.addClass("color-theme-"+fontState.theme);
 59 | 
 60 |         saveFontSettings();
 61 |     };
 62 | 
 63 |     function update() {
 64 |         var $book = gitbook.state.$book;
 65 | 
 66 |         $(".font-settings .font-family-list li").removeClass("active");
 67 |         $(".font-settings .font-family-list li:nth-child("+(fontState.family+1)+")").addClass("active");
 68 | 
 69 |         $book[0].className = $book[0].className.replace(/\bfont-\S+/g, '');
 70 |         $book.addClass("font-size-"+fontState.size);
 71 |         $book.addClass("font-family-"+fontState.family);
 72 | 
 73 |         if(fontState.theme !== 0) {
 74 |             $book[0].className = $book[0].className.replace(/\bcolor-theme-\S+/g, '');
 75 |             $book.addClass("color-theme-"+fontState.theme);
 76 |         }
 77 |     };
 78 | 
 79 |     function init(config) {
 80 |         var $bookBody, $book;
 81 | 
 82 |         //Find DOM elements.
 83 |         $book = gitbook.state.$book;
 84 |         $bookBody = $book.find(".book-body");
 85 | 
 86 |         // Instantiate font state object
 87 |         fontState = gitbook.storage.get("fontState", {
 88 |             size: config.size || 2,
 89 |             family: FAMILY[config.family || "sans"],
 90 |             theme: THEMES[config.theme || "white"]
 91 |         });
 92 | 
 93 |         update();
 94 |     };
 95 | 
 96 | 
 97 |     gitbook.events.bind("start", function(e, config) {
 98 |         var opts = config.fontsettings;
 99 |         if (!opts) return;
100 |         
101 |         // Create buttons in toolbar
102 |         gitbook.toolbar.createButton({
103 |             icon: 'fa fa-font',
104 |             label: 'Font Settings',
105 |             className: 'font-settings',
106 |             dropdown: [
107 |                 [
108 |                     {
109 |                         text: 'A',
110 |                         className: 'font-reduce',
111 |                         onClick: reduceFontSize
112 |                     },
113 |                     {
114 |                         text: 'A',
115 |                         className: 'font-enlarge',
116 |                         onClick: enlargeFontSize
117 |                     }
118 |                 ],
119 |                 [
120 |                     {
121 |                         text: 'Serif',
122 |                         onClick: _.partial(changeFontFamily, 0)
123 |                     },
124 |                     {
125 |                         text: 'Sans',
126 |                         onClick: _.partial(changeFontFamily, 1)
127 |                     }
128 |                 ],
129 |                 [
130 |                     {
131 |                         text: 'White',
132 |                         onClick: _.partial(changeColorTheme, 0)
133 |                     },
134 |                     {
135 |                         text: 'Sepia',
136 |                         onClick: _.partial(changeColorTheme, 1)
137 |                     },
138 |                     {
139 |                         text: 'Night',
140 |                         onClick: _.partial(changeColorTheme, 2)
141 |                     }
142 |                 ]
143 |             ]
144 |         });
145 | 
146 | 
147 |         // Init current settings
148 |         init(opts);
149 |     });
150 | });
151 | 
152 | 
153 | 


--------------------------------------------------------------------------------
/.Rproj.user/4A13D082/sources/prop/INDEX:
--------------------------------------------------------------------------------
 1 | A%3A%2FGaowenxin_notes%2FDL%2Fdeep_learn.Rmd="7D30E6E5"
 2 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2FJZ_offer.Rmd="B6121ABB"
 3 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2FMakefile="F6B97466"
 4 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2FR%2Fcalc_woe.R="A4CD0DFC"
 5 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2FREADME.md="9231311B"
 6 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fanalysis%2FDP.Rmd="0AEDBE83"
 7 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fanalysis%2Farray.Rmd="640A0840"
 8 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fanalysis%2Fbase_kg.Rmd="C425B331"
 9 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fanalysis%2Fhuisu.Rmd="EC98685D"
10 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fanalysis%2Fjiano.Rmd="273FFFF4"
11 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fanalysis%2Fk-num-sum.Rmd="7836F524"
12 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fanalysis%2Fleetcode.Rmd="F0CB30BC"
13 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fanalysis%2Flianbiao.Rmd="75B7BA78"
14 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fanalysis%2Fsort.Rmd="6EF22B8E"
15 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fanalysis%2Fsort.py="C8EC9777"
16 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fanalysis%2Fstring.Rmd="218D07AE"
17 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fanalysis%2Fstring.html="9603485A"
18 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fanalysis%2Fsummary.Rmd="B388D734"
19 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fanalysis%2Ftanxin.Rmd="D81B219D"
20 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fanalysis%2Ftime_complexity.Rmd="7516B97D"
21 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fcode%2Fbuild-jupyter-notebook.R="1B28BD80"
22 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fcode%2Fbuild-model-notes.R="CE2753F1"
23 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fcode%2Fbuild-readme.R="32335F09"
24 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fcode%2Fbuild.R="2E529242"
25 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fcode%2Fclean.R="D0A7FD8C"
26 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fcode%2Fcopy-md.R="9002298D"
27 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fcode%2Fpush.R="1BF2BFA0"
28 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fcxmsbd.Rmd="9200D031"
29 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fcxmsbd_py.Rmd="CB210309"
30 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fec.Rmd="91164974"
31 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Ferchashu.Rmd="1CE5C906"
32 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fleetcode.Rmd="6B4EB6C4"
33 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Fpy_base.Rmd="004A92D8"
34 | A%3A%2FGaowenxin_notes%2Fle_leetcode%2Ftree.Rmd="C354AE86"
35 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2FJZ_offer.Rmd="DFE47971"
36 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2FMakefile="F09DAD79"
37 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2FREADME.md="F49B45D8"
38 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Fanalysis%2F%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92%E9%97%AE%E9%A2%98.html="057DD778"
39 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Fanalysis%2FDP.Rmd="CDCF8015"
40 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Fanalysis%2Farray.Rmd="30E39A56"
41 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Fanalysis%2Fbase_kg.Rmd="4CF42BE3"
42 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Fanalysis%2Fdandiao_stack.Rmd="278D01CC"
43 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Fanalysis%2Fhuisu.Rmd="3B83C718"
44 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Fanalysis%2Fjiano.Rmd="13519BB2"
45 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Fanalysis%2Fk-num-sum.Rmd="E154C21D"
46 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Fanalysis%2Flianbiao.Rmd="A3266D02"
47 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Fanalysis%2Fsort.Rmd="52D9BB00"
48 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Fanalysis%2Fsort.py="BB4CEBA7"
49 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Fanalysis%2Fstring.Rmd="8483E3E1"
50 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Fanalysis%2Fsummary.Rmd="79425DAB"
51 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Fanalysis%2Ftanxin.Rmd="7102EA36"
52 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Fdandiao_stack.Rmd="6A154252"
53 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Ferchashu.Rmd="3D9C9DC3"
54 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Fleetcode_hot.Rmd="B115194C"
55 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Fqueue_and_stack.Rmd="3536E7CE"
56 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Fslide_window.Rmd="AFC7CA29"
57 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Ftree.Rmd="0EBEF394"
58 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Ftree.html="5103E99D"
59 | A%3A%2FGaowenxin_notes%2Fleetcode%2Fleetcode-cookbook%2Ftwo_tree.Rmd="145E0D85"
60 | A%3A%2FGaowenxin_notes%2Fleetcode-cookbook%2Fleetcode-cookbook.Rmd="A6145623"
61 | A%3A%2FGaowenxin_notes%2Fleetcode-cookbook%2Fleetcode.Rmd="800F1B8A"
62 | A%3A%2FLijiaxiang%2Flearn_credit_risk%2Flearning_notes.Rmd="3343B2B3"
63 | A%3A%2FLijiaxiang%2Fusd-dea%2Fdev_history_r_proj.R="2A3D5609"
64 | 


--------------------------------------------------------------------------------
/栈和队列.html:
--------------------------------------------------------------------------------
  1 | <!DOCTYPE html>
  2 | <html lang="" xml:lang="">
  3 | <head>
  4 | 
  5 |   <meta charset="utf-8" />
  6 |   <meta http-equiv="X-UA-Compatible" content="IE=edge" />
  7 |   <title>栈和队列</title>
  8 |   <meta name="description" content="栈和队列" />
  9 |   <meta name="generator" content="bookdown 0.19 and GitBook 2.6.7" />
 10 | 
 11 |   <meta property="og:title" content="栈和队列" />
 12 |   <meta property="og:type" content="book" />
 13 |   
 14 |   
 15 |   
 16 |   
 17 | 
 18 |   <meta name="twitter:card" content="summary" />
 19 |   <meta name="twitter:title" content="栈和队列" />
 20 |   
 21 |   
 22 |   
 23 | 
 24 | <meta name="author" content="高文欣" />
 25 | 
 26 | 
 27 | <meta name="date" content="2023-05-18" />
 28 | 
 29 |   <meta name="viewport" content="width=device-width, initial-scale=1" />
 30 |   <meta name="apple-mobile-web-app-capable" content="yes" />
 31 |   <meta name="apple-mobile-web-app-status-bar-style" content="black" />
 32 |   
 33 |   
 34 | 
 35 | 
 36 | <script src="libs/header-attrs-2.2/header-attrs.js"></script>
 37 | <script src="libs/jquery-2.2.3/jquery.min.js"></script>
 38 | <link href="libs/gitbook-2.6.7/css/style.css" rel="stylesheet" />
 39 | <link href="libs/gitbook-2.6.7/css/plugin-table.css" rel="stylesheet" />
 40 | <link href="libs/gitbook-2.6.7/css/plugin-bookdown.css" rel="stylesheet" />
 41 | <link href="libs/gitbook-2.6.7/css/plugin-highlight.css" rel="stylesheet" />
 42 | <link href="libs/gitbook-2.6.7/css/plugin-search.css" rel="stylesheet" />
 43 | <link href="libs/gitbook-2.6.7/css/plugin-fontsettings.css" rel="stylesheet" />
 44 | <link href="libs/gitbook-2.6.7/css/plugin-clipboard.css" rel="stylesheet" />
 45 | 
 46 | 
 47 | 
 48 | 
 49 | 
 50 | 
 51 | 
 52 | 
 53 | 
 54 | 
 55 | 
 56 | 
 57 | </head>
 58 | 
 59 | <body>
 60 | 
 61 | 
 62 | 
 63 |   <div class="book without-animation with-summary font-size-2 font-family-1" data-basepath=".">
 64 | 
 65 |     <div class="book-summary">
 66 |       <nav role="navigation">
 67 | 
 68 | <ul class="summary">
 69 | <li class="chapter" data-level="1" data-path=""><a href="#栈和队列"><i class="fa fa-check"></i><b>1</b> 栈和队列</a>
 70 | <ul>
 71 | <li class="chapter" data-level="1.1" data-path=""><a href="#栈与递归的关系"><i class="fa fa-check"></i><b>1.1</b> 栈与递归的关系</a></li>
 72 | </ul></li>
 73 | </ul>
 74 | 
 75 |       </nav>
 76 |     </div>
 77 | 
 78 |     <div class="book-body">
 79 |       <div class="body-inner">
 80 |         <div class="book-header" role="navigation">
 81 |           <h1>
 82 |             <i class="fa fa-circle-o-notch fa-spin"></i><a href="./">栈和队列</a>
 83 |           </h1>
 84 |         </div>
 85 | 
 86 |         <div class="page-wrapper" tabindex="-1" role="main">
 87 |           <div class="page-inner">
 88 | 
 89 |             <section class="normal" id="section-">
 90 | <div id="header">
 91 | <h1 class="title">栈和队列</h1>
 92 | <p class="author"><em>高文欣</em></p>
 93 | <p class="date"><em>2023-05-18</em></p>
 94 | </div>
 95 | <div id="栈和队列" class="section level1" number="1">
 96 | <h1><span class="header-section-number">1</span> 栈和队列</h1>
 97 | <div id="栈与递归的关系" class="section level2" number="1.1">
 98 | <h2><span class="header-section-number">1.1</span> 栈与递归的关系</h2>
 99 | <p>通常,当在一个函数的运行期间调用另一个函数时,在运行被调用函数之前,系统要做三件事:</p>
100 | <ul>
101 | <li>将所有的实参,返回地址等信息调用传递给被调用函数保存;</li>
102 | <li>为被调用函数的局部变量分配存储空间;</li>
103 | <li>将控制权转移到被调用函数入口;</li>
104 | </ul>
105 | <p>一个递归函数的运行过程类似多个函数的嵌套调用,只是调用函数和被调用函数都是同一个函数,因此,每次调用本身时,就会产生一个调用相关的一个重要概念就是递归函数运行的“层次”.假设调用该递归函数的主函数为第0层,则从主函数调用递归函数进入到第一层,从第i层递归调用本函数进入下一层为第i+1层,反之退出第i层递归函数返回上一层为第i-1层;
106 | 为了保证递归函数正确执行,系统需要设立一个“递归工作栈”作为整个递归函数运行期间使用的数据存储区,每一层递归所需信息构成一个工作记录,其中包括所有实参,所有局部变量以及上一层的返回地址.每进入一层递归,就产生一个新的工作记录压入栈顶,每退出一个递归,就从栈顶弹出一个工作记录,则当前执行层的工作记录必须是递归工作栈栈顶的工作记录,此称为“活动记录”;<a href="https://www.jianshu.com/p/0d62fc267520">【ChaosHeart】</a></p>
107 | </div>
108 | </div>
109 |             </section>
110 | 
111 |           </div>
112 |         </div>
113 |       </div>
114 | 
115 | 
116 |     </div>
117 |   </div>
118 | <script src="libs/gitbook-2.6.7/js/app.min.js"></script>
119 | <script src="libs/gitbook-2.6.7/js/lunr.js"></script>
120 | <script src="libs/gitbook-2.6.7/js/clipboard.min.js"></script>
121 | <script src="libs/gitbook-2.6.7/js/plugin-search.js"></script>
122 | <script src="libs/gitbook-2.6.7/js/plugin-sharing.js"></script>
123 | <script src="libs/gitbook-2.6.7/js/plugin-fontsettings.js"></script>
124 | <script src="libs/gitbook-2.6.7/js/plugin-bookdown.js"></script>
125 | <script src="libs/gitbook-2.6.7/js/jquery.highlight.js"></script>
126 | <script src="libs/gitbook-2.6.7/js/plugin-clipboard.js"></script>
127 | <script>
128 | gitbook.require(["gitbook"], function(gitbook) {
129 | gitbook.start({
130 | "sharing": {
131 | "github": false,
132 | "facebook": true,
133 | "twitter": true,
134 | "linkedin": false,
135 | "weibo": false,
136 | "instapaper": false,
137 | "vk": false,
138 | "all": ["facebook", "twitter", "linkedin", "weibo", "instapaper"]
139 | },
140 | "fontsettings": {
141 | "theme": "white",
142 | "family": "sans",
143 | "size": 2
144 | },
145 | "edit": {
146 | "link": null,
147 | "text": null
148 | },
149 | "history": {
150 | "link": null,
151 | "text": null
152 | },
153 | "view": {
154 | "link": null,
155 | "text": null
156 | },
157 | "download": null,
158 | "toc": {
159 | "collapse": "subsection"
160 | },
161 | "search": false
162 | });
163 | });
164 | </script>
165 | 
166 | </body>
167 | 
168 | </html>
169 | 


--------------------------------------------------------------------------------
/analysis/array.Rmd:
--------------------------------------------------------------------------------
  1 | ---
  2 | title : 数组专题
  3 | author: 高文欣
  4 | date: "`r Sys.Date()`"
  5 | output: bookdown::gitbook
  6 | bibliography: ../refs/add.bib
  7 | ---
  8 | 
  9 | # 数组专题
 10 | 
 11 | ## 长度最小的子数组
 12 | 
 13 | - 题目描述
 14 | 
 15 | 给定一个含有 n 个正整数的数组和一个正整数 target 。
 16 | 
 17 | 找出该数组中满足其和 ≥ target 的长度最小的 连续子数组 [numsl, numsl+1, ..., numsr-1, numsr] ，并返回其长度。如果不存在符合条件的子数组，返回 0 。
 18 | 
 19 | 
 20 | - 解题思路
 21 | 
 22 |  比较典型的滑动窗口
 23 |  
 24 | 主要确定如下三点：
 25 | 
 26 | - 窗口内是什么？
 27 | - 如何移动窗口的起始位置？
 28 | - 如何移动窗口的结束位置？
 29 | 
 30 | >窗口就是 满足其和 ≥ s 的长度最小的连续子数组。
 31 | 窗口的起始位置如何移动：如果当前窗口的值大于s了，窗口就要向前移动了（也就是该缩小了）。
 32 | 窗口的结束位置如何移动：窗口的结束位置就是遍历数组的指针，窗口的起始位置设置为数组的起始位置就可以了。
 33 | 解题的关键在于 窗口的起始位置如何移动，如图所示：
 34 | 
 35 | ![](../figs/array_1.png)
 36 | 
 37 | 
 38 | ```r
 39 | class Solution:
 40 |     def minSubArrayLen(self, s: int, nums: List[int]) -> int:
 41 |         # 定义一个无限大的数
 42 |         res = float("inf")
 43 |         Sum = 0 # 当前总和
 44 |         index = 0 # 当前索引
 45 |         for i in range(len(nums)):
 46 |             Sum += nums[i]
 47 |             while Sum >= s:
 48 |                 res = min(res, i-index+1)
 49 |                 Sum -= nums[index] # 滑动窗口的精髓，不断变更index
 50 |                 index += 1
 51 |         return 0 if res==float("inf") else res
 52 | ```
 53 | 
 54 | 
 55 | 
 56 | ## 两个数组的交集
 57 | 
 58 | - 题目描述
 59 | 
 60 | 给定两个数组，编写一个函数来计算它们的交集。
 61 | 输入: nums1 = [1,2,2,1], nums2 = [2,2]
 62 | 输出: [2,2]
 63 | 
 64 | 
 65 | ```r
 66 | res=[]
 67 | def jiaoji(nums1,nums2):
 68 |    for k in nums2:
 69 |        if k in nums1:
 70 |            res.append(k)
 71 |            nums1.remove(k)
 72 |    return res
 73 | 
 74 | print(jiaoji(nums1,nums2))
 75 | ```
 76 | 
 77 | 
 78 | 
 79 | ## 旋转数组
 80 | 
 81 | - 题目描述
 82 | 
 83 | 给定一个数组，将数组中的元素向右移动 k 个位置，其中 k 是非负数。
 84 | 示例 1:
 85 | 输入: [1,2,3,4,5,6,7] 和 k = 3
 86 | 输出: [5,6,7,1,2,3,4]
 87 | 
 88 | ```r
 89 | arr=[1,2,3,4,5,6,7]
 90 | def xz(nums,k):
 91 |     return nums[k:]+nums[:k]
 92 | 
 93 | print(xz(arr,3))
 94 | ```
 95 | 
 96 | ## 移除元素
 97 | 
 98 | - 题目描述
 99 | >
100 | #给你一个数组 nums 和一个值 val，你需要 原地 移除所有数值等于 val 的元素，并返回移除后数组的新长度。
101 | 
102 | 不要使用额外的数组空间，你必须仅使用 O(1) 额外空间并原地修改输入数组。
103 | 
104 | 元素的顺序可以改变。你不需要考虑数组中超出新长度后面的元素。
105 | 
106 | 示例 1: 给定 nums = [3,2,2,3], val = 3, 函数应该返回新的长度 2, 并且 nums 中的前两个元素均为 2。 你不需要考虑数组中超出新长度后面的元素。
107 | 
108 | 示例 2: 给定 nums = [0,1,2,2,3,0,4,2], val = 2, 函数应该返回新的长度 5, 并且 nums 中的前五个元素为 0, 1, 3, 0, 4。
109 | 
110 | 你不需要考虑数组中超出新长度后面的元素。
111 | 
112 | - 解题思路
113 | 
114 | 还是指针
115 | 
116 | ``` r
117 | 
118 | class Solution:
119 |     def removeElement(self, nums: List[int], val: int) -> int:
120 |         i,n = 0,len(nums)
121 |         for j in range(n):
122 |             if nums[j] != val:
123 |                 nums[i] = nums[j]
124 |                 i += 1
125 |         return i
126 | ```
127 | 
128 | ## 加一
129 | 
130 | - 题目描述
131 | 
132 | 给定一个由整数组成的非空数组所表示的非负整数，在该数的基础上加一。
133 | 
134 | 最高位数字存放在数组的首位， 数组中每个元素只存储单个数字。
135 | 
136 | 你可以假设除了整数 0 之外，这个整数不会以零开头。
137 | 
138 | 示例 1:
139 | 
140 | 输入: [1,2,3]
141 | 输出: [1,2,4]
142 | 解释: 输入数组表示数字 123。
143 | 示例 2:
144 | 
145 | 输入: [4,3,2,1]
146 | 输出: [4,3,2,2]
147 | 解释: 输入数组表示数字 4321。
148 | 
149 | 解题思路是转化为数字加完了再转化为数组
150 | 
151 | ``` r
152 | s=[4,3,2,1]
153 | def jiayi(s):
154 |     nus=[v*10**index for index,v in enumerate(s[::-1])]
155 |     newv=sum(nus)+1
156 |     return [int(x) for x in str(newv)]
157 | 
158 | 
159 | print(jiayi(s))
160 | ```
161 | 
162 | ## 两数之和
163 | 
164 | 给定一个整数数组 nums 和一个目标值 target，请你在该数组中找出和为目标值的那 两个 整数，并返回他们的数组下标。
165 | 你可以假设每种输入只会对应一个答案。但是，你不能重复利用这个数组中同样的元素。
166 | 
167 | 示例:
168 | 
169 | 给定 nums = [2, 7, 11, 15], target = 9
170 | 因为 nums[0] + nums[1] = 2 + 7 = 9
171 | 所以返回 [0, 1]
172 | 
173 | ```r
174 | 
175 | def twoSum(nums, target) :
176 |     d = {}
177 |     for k, v in enumerate(nums):
178 |         if target - v in d:
179 |             return [d[target - v], k]
180 |         d[v] = k
181 | print(twoSum(nums,target))
182 | 
183 | ```
184 | 
185 | ## 三数之和
186 | 
187 | 给你一个包含 n 个整数的数组 nums，判断 nums 中是否存在三个元素 a，b，c
188 | ，使得 a + b + c = 0 ？请你找出所有满足条件且不重复的三元组。
189 | 
190 | 注意：答案中不可以包含重复的三元组。
191 | 
192 |  
193 | 
194 | 示例：
195 | 
196 | 给定数组 nums = [-1, 0, 1, 2, -1, -4]，
197 | 
198 | 满足要求的三元组集合为： [ [-1, 0, 1], [-1, -1, 2]]
199 | 
200 | - 解题思路
201 | 
202 | 这个题，哎只能想到贼暴力的解法，看了大佬们的解法，只能惊叹！！牛逼的太多了
203 | 
204 | 排序 + 双指针 本题的难点在于如何去除重复解。 算法流程：
205 | 1.特判，对于数组长度 $n,$ 如果数组为 $n u l l$ 或者数组长度小于 $3,$ 返回
206 | []$.$ 
207 | 2. 对数组进行排序。 
208 | 3. 遍历排序后数组。若 $n u m s[i]>0:$
209 | 因为已经排序好, 所以后面不可能有三个数加和等于 0，直接返回结果。
210 | 对于重复元素：跳过, 避免出现重复解 令左指针 $L=i+1,$ 右指针 $R=n-1,$ 当
211 | $L<R$ 时, 执行循环:
212 | 
213 | - 当$\operatorname{nums}[i]+\operatorname{nums}[L]+\operatorname{nums}[R]==0$,
214 | 执行循环，判断左界和右界是否和下一位置重 复, 去除重复解。并同时将 $L, R$
215 | 移到下一位置，寻找新的解 若和大于 $0,$ 说明 $n u m s[R]$ 太大, $\quad R$
216 | 左移 
217 | 
218 | - 若和小于 $0,$ 说明 $n u m s[L]$ 太小， $L$ 右移 复杂度分析
219 | 
220 | ```r
221 | class Solution:
222 |     def threeSum(self, nums: List[int]) -> List[List[int]]:
223 |         
224 |         n=len(nums)
225 |         res=[]
226 |         if(not nums or n<3):
227 |             return []
228 |         nums.sort() # 先排序
229 |         res=[] # 定义一个结果list
230 |         for i in range(n): # 如果元素都大于0，无解
231 |             if(nums[i]>0):
232 |                 return res
233 |             if(i>0 and nums[i]==nums[i-1]):
234 |                 continue
235 |             L=i+1 # 明显的滑动窗口
236 |             R=n-1
237 |             while(L<R):
238 |                 if(nums[i]+nums[L]+nums[R]==0):
239 |                     res.append([nums[i],nums[L],nums[R]])
240 |                     while(L<R and nums[L]==nums[L+1]):
241 |                         L=L+1
242 |                     while(L<R and nums[R]==nums[R-1]):
243 |                         R=R-1
244 |                     L=L+1
245 |                     R=R-1
246 |                 elif(nums[i]+nums[L]+nums[R]>0):
247 |                     R=R-1
248 |                 else:
249 |                     L=L+1
250 |         return res
251 | 
252 | ```
253 | 
254 | ## 合并两个有序数组
255 | 
256 | 
257 | ```r
258 | def merge(A,m,B,n):
259 |     A[m:m+n] = B # 直接扩展数组A
260 |     A.sort()
261 | 
262 | if __name__ == "__main__":
263 |     A = [4,5,6]
264 |     B = [1,2,3]
265 |     merge(A,3,B,3)
266 |     print(A)
267 | 
268 | ```
269 | 
270 | 
271 | 
272 | 
273 | 
274 | 


--------------------------------------------------------------------------------
/libs/gitbook-2.6.7/js/plugin-search.js:
--------------------------------------------------------------------------------
  1 | gitbook.require(["gitbook", "lodash", "jQuery"], function(gitbook, _, $) {
  2 |     var index = null;
  3 |     var $searchInput, $searchLabel, $searchForm;
  4 |     var $highlighted = [], hi, hiOpts = { className: 'search-highlight' };
  5 |     var collapse = false, toc_visible = [];
  6 | 
  7 |     // Use a specific index
  8 |     function loadIndex(data) {
  9 |         // [Yihui] In bookdown, I use a character matrix to store the chapter
 10 |         // content, and the index is dynamically built on the client side.
 11 |         // Gitbook prebuilds the index data instead: https://github.com/GitbookIO/plugin-search
 12 |         // We can certainly do that via R packages V8 and jsonlite, but let's
 13 |         // see how slow it really is before improving it. On the other hand,
 14 |         // lunr cannot handle non-English text very well, e.g. the default
 15 |         // tokenizer cannot deal with Chinese text, so we may want to replace
 16 |         // lunr with a dumb simple text matching approach.
 17 |         index = lunr(function () {
 18 |           this.ref('url');
 19 |           this.field('title', { boost: 10 });
 20 |           this.field('body');
 21 |         });
 22 |         data.map(function(item) {
 23 |           index.add({
 24 |             url: item[0],
 25 |             title: item[1],
 26 |             body: item[2]
 27 |           });
 28 |         });
 29 |     }
 30 | 
 31 |     // Fetch the search index
 32 |     function fetchIndex() {
 33 |         return $.getJSON(gitbook.state.basePath+"/search_index.json")
 34 |                 .then(loadIndex);  // [Yihui] we need to use this object later
 35 |     }
 36 | 
 37 |     // Search for a term and return results
 38 |     function search(q) {
 39 |         if (!index) return;
 40 | 
 41 |         var results = _.chain(index.search(q))
 42 |         .map(function(result) {
 43 |             var parts = result.ref.split("#");
 44 |             return {
 45 |                 path: parts[0],
 46 |                 hash: parts[1]
 47 |             };
 48 |         })
 49 |         .value();
 50 | 
 51 |         // [Yihui] Highlight the search keyword on current page
 52 |         $highlighted = results.length === 0 ? [] : $('.page-inner')
 53 |           .unhighlight(hiOpts).highlight(q, hiOpts).find('span.search-highlight');
 54 |         scrollToHighlighted(0);
 55 | 
 56 |         return results;
 57 |     }
 58 | 
 59 |     // [Yihui] Scroll the chapter body to the i-th highlighted string
 60 |     function scrollToHighlighted(d) {
 61 |       var n = $highlighted.length;
 62 |       hi = hi === undefined ? 0 : hi + d;
 63 |       // navignate to the previous/next page in the search results if reached the top/bottom
 64 |       var b = hi < 0;
 65 |       if (d !== 0 && (b || hi >= n)) {
 66 |         var path = currentPath(), n2 = toc_visible.length;
 67 |         if (n2 === 0) return;
 68 |         for (var i = b ? 0 : n2; (b && i < n2) || (!b && i >= 0); i += b ? 1 : -1) {
 69 |           if (toc_visible.eq(i).data('path') === path) break;
 70 |         }
 71 |         i += b ? -1 : 1;
 72 |         if (i < 0) i = n2 - 1;
 73 |         if (i >= n2) i = 0;
 74 |         var lnk = toc_visible.eq(i).find('a[href$=".html"]');
 75 |         if (lnk.length) lnk[0].click();
 76 |         return;
 77 |       }
 78 |       if (n === 0) return;
 79 |       var $p = $highlighted.eq(hi);
 80 |       $p[0].scrollIntoView();
 81 |       $highlighted.css('background-color', '');
 82 |       // an orange background color on the current item and removed later
 83 |       $p.css('background-color', 'orange');
 84 |       setTimeout(function() {
 85 |         $p.css('background-color', '');
 86 |       }, 2000);
 87 |     }
 88 | 
 89 |     function currentPath() {
 90 |       var href = window.location.pathname;
 91 |       href = href.substr(href.lastIndexOf('/') + 1);
 92 |       return href === '' ? 'index.html' : href;
 93 |     }
 94 | 
 95 |     // Create search form
 96 |     function createForm(value) {
 97 |         if ($searchForm) $searchForm.remove();
 98 |         if ($searchLabel) $searchLabel.remove();
 99 |         if ($searchInput) $searchInput.remove();
100 | 
101 |         $searchForm = $('<div>', {
102 |             'class': 'book-search',
103 |             'role': 'search'
104 |         });
105 | 
106 |         $searchLabel = $('<label>', {
107 |             'for': 'search-box',
108 |             'aria-hidden': 'false',
109 |             'hidden': ''
110 |         });
111 | 
112 |         $searchInput = $('<input>', {
113 |             'id': 'search-box',
114 |             'type': 'search',
115 |             'class': 'form-control',
116 |             'val': value,
117 |             'placeholder': 'Type to search (Enter for navigation)',
118 |             'title': 'Use Enter or the <Down> key to navigate to the next match, or the <Up> key to the previous match'
119 |         });
120 | 
121 |         $searchLabel.append("Type to search");
122 |         $searchLabel.appendTo($searchForm);
123 |         $searchInput.appendTo($searchForm);
124 |         $searchForm.prependTo(gitbook.state.$book.find('.book-summary'));
125 |     }
126 | 
127 |     // Return true if search is open
128 |     function isSearchOpen() {
129 |         return gitbook.state.$book.hasClass("with-search");
130 |     }
131 | 
132 |     // Toggle the search
133 |     function toggleSearch(_state) {
134 |         if (isSearchOpen() === _state) return;
135 |         if (!$searchInput) return;
136 | 
137 |         gitbook.state.$book.toggleClass("with-search", _state);
138 | 
139 |         // If search bar is open: focus input
140 |         if (isSearchOpen()) {
141 |             gitbook.sidebar.toggle(true);
142 |             $searchInput.focus();
143 |         } else {
144 |             $searchInput.blur();
145 |             $searchInput.val("");
146 |             gitbook.storage.remove("keyword");
147 |             gitbook.sidebar.filter(null);
148 |             $('.page-inner').unhighlight(hiOpts);
149 |         }
150 |     }
151 | 
152 |     function sidebarFilter(results) {
153 |         gitbook.sidebar.filter(_.pluck(results, "path"));
154 |         toc_visible = $('ul.summary').find('li:visible');
155 |     }
156 | 
157 |     // Recover current search when page changed
158 |     function recoverSearch() {
159 |         var keyword = gitbook.storage.get("keyword", "");
160 | 
161 |         createForm(keyword);
162 | 
163 |         if (keyword.length > 0) {
164 |             if(!isSearchOpen()) {
165 |                 toggleSearch(true); // [Yihui] open the search box
166 |             }
167 |             sidebarFilter(search(keyword));
168 |         }
169 |     }
170 | 
171 | 
172 |     gitbook.events.bind("start", function(e, config) {
173 |         // [Yihui] disable search
174 |         if (config.search === false) return;
175 |         collapse = !config.toc || config.toc.collapse === 'section' ||
176 |           config.toc.collapse === 'subsection';
177 | 
178 |         // Pre-fetch search index and create the form
179 |         fetchIndex()
180 |         // [Yihui] recover search after the page is loaded
181 |         .then(recoverSearch);
182 | 
183 | 
184 |         // Type in search bar
185 |         $(document).on("keyup", ".book-search input", function(e) {
186 |             var key = (e.keyCode ? e.keyCode : e.which);
187 |             // [Yihui] Escape -> close search box; Up/Down/Enter: previous/next highlighted
188 |             if (key == 27) {
189 |                 e.preventDefault();
190 |                 toggleSearch(false);
191 |             } else if (key == 38) {
192 |               scrollToHighlighted(-1);
193 |             } else if (key == 40 || key == 13) {
194 |               scrollToHighlighted(1);
195 |             }
196 |         }).on("input", ".book-search input", function(e) {
197 |             var q = $(this).val().trim();
198 |             if (q.length === 0) {
199 |                 gitbook.sidebar.filter(null);
200 |                 gitbook.storage.remove("keyword");
201 |                 $('.page-inner').unhighlight(hiOpts);
202 |             } else {
203 |                 var results = search(q);
204 |                 sidebarFilter(results);
205 |                 gitbook.storage.set("keyword", q);
206 |             }
207 |         });
208 | 
209 |         // Create the toggle search button
210 |         gitbook.toolbar.createButton({
211 |             icon: 'fa fa-search',
212 |             label: 'Search',
213 |             position: 'left',
214 |             onClick: toggleSearch
215 |         });
216 | 
217 |         // Bind keyboard to toggle search
218 |         gitbook.keyboard.bind(['f'], toggleSearch);
219 |     });
220 | 
221 |     // [Yihui] do not try to recover search; always start fresh
222 |     // gitbook.events.bind("page.change", recoverSearch);
223 | });
224 | 


--------------------------------------------------------------------------------
/analysis/libs/gitbook-2.6.7/js/plugin-search.js:
--------------------------------------------------------------------------------
  1 | gitbook.require(["gitbook", "lodash", "jQuery"], function(gitbook, _, $) {
  2 |     var index = null;
  3 |     var $searchInput, $searchLabel, $searchForm;
  4 |     var $highlighted = [], hi, hiOpts = { className: 'search-highlight' };
  5 |     var collapse = false, toc_visible = [];
  6 | 
  7 |     // Use a specific index
  8 |     function loadIndex(data) {
  9 |         // [Yihui] In bookdown, I use a character matrix to store the chapter
 10 |         // content, and the index is dynamically built on the client side.
 11 |         // Gitbook prebuilds the index data instead: https://github.com/GitbookIO/plugin-search
 12 |         // We can certainly do that via R packages V8 and jsonlite, but let's
 13 |         // see how slow it really is before improving it. On the other hand,
 14 |         // lunr cannot handle non-English text very well, e.g. the default
 15 |         // tokenizer cannot deal with Chinese text, so we may want to replace
 16 |         // lunr with a dumb simple text matching approach.
 17 |         index = lunr(function () {
 18 |           this.ref('url');
 19 |           this.field('title', { boost: 10 });
 20 |           this.field('body');
 21 |         });
 22 |         data.map(function(item) {
 23 |           index.add({
 24 |             url: item[0],
 25 |             title: item[1],
 26 |             body: item[2]
 27 |           });
 28 |         });
 29 |     }
 30 | 
 31 |     // Fetch the search index
 32 |     function fetchIndex() {
 33 |         return $.getJSON(gitbook.state.basePath+"/search_index.json")
 34 |                 .then(loadIndex);  // [Yihui] we need to use this object later
 35 |     }
 36 | 
 37 |     // Search for a term and return results
 38 |     function search(q) {
 39 |         if (!index) return;
 40 | 
 41 |         var results = _.chain(index.search(q))
 42 |         .map(function(result) {
 43 |             var parts = result.ref.split("#");
 44 |             return {
 45 |                 path: parts[0],
 46 |                 hash: parts[1]
 47 |             };
 48 |         })
 49 |         .value();
 50 | 
 51 |         // [Yihui] Highlight the search keyword on current page
 52 |         $highlighted = results.length === 0 ? [] : $('.page-inner')
 53 |           .unhighlight(hiOpts).highlight(q, hiOpts).find('span.search-highlight');
 54 |         scrollToHighlighted(0);
 55 | 
 56 |         return results;
 57 |     }
 58 | 
 59 |     // [Yihui] Scroll the chapter body to the i-th highlighted string
 60 |     function scrollToHighlighted(d) {
 61 |       var n = $highlighted.length;
 62 |       hi = hi === undefined ? 0 : hi + d;
 63 |       // navignate to the previous/next page in the search results if reached the top/bottom
 64 |       var b = hi < 0;
 65 |       if (d !== 0 && (b || hi >= n)) {
 66 |         var path = currentPath(), n2 = toc_visible.length;
 67 |         if (n2 === 0) return;
 68 |         for (var i = b ? 0 : n2; (b && i < n2) || (!b && i >= 0); i += b ? 1 : -1) {
 69 |           if (toc_visible.eq(i).data('path') === path) break;
 70 |         }
 71 |         i += b ? -1 : 1;
 72 |         if (i < 0) i = n2 - 1;
 73 |         if (i >= n2) i = 0;
 74 |         var lnk = toc_visible.eq(i).find('a[href$=".html"]');
 75 |         if (lnk.length) lnk[0].click();
 76 |         return;
 77 |       }
 78 |       if (n === 0) return;
 79 |       var $p = $highlighted.eq(hi);
 80 |       $p[0].scrollIntoView();
 81 |       $highlighted.css('background-color', '');
 82 |       // an orange background color on the current item and removed later
 83 |       $p.css('background-color', 'orange');
 84 |       setTimeout(function() {
 85 |         $p.css('background-color', '');
 86 |       }, 2000);
 87 |     }
 88 | 
 89 |     function currentPath() {
 90 |       var href = window.location.pathname;
 91 |       href = href.substr(href.lastIndexOf('/') + 1);
 92 |       return href === '' ? 'index.html' : href;
 93 |     }
 94 | 
 95 |     // Create search form
 96 |     function createForm(value) {
 97 |         if ($searchForm) $searchForm.remove();
 98 |         if ($searchLabel) $searchLabel.remove();
 99 |         if ($searchInput) $searchInput.remove();
100 | 
101 |         $searchForm = $('<div>', {
102 |             'class': 'book-search',
103 |             'role': 'search'
104 |         });
105 | 
106 |         $searchLabel = $('<label>', {
107 |             'for': 'search-box',
108 |             'aria-hidden': 'false',
109 |             'hidden': ''
110 |         });
111 | 
112 |         $searchInput = $('<input>', {
113 |             'id': 'search-box',
114 |             'type': 'search',
115 |             'class': 'form-control',
116 |             'val': value,
117 |             'placeholder': 'Type to search (Enter for navigation)',
118 |             'title': 'Use Enter or the <Down> key to navigate to the next match, or the <Up> key to the previous match'
119 |         });
120 | 
121 |         $searchLabel.append("Type to search");
122 |         $searchLabel.appendTo($searchForm);
123 |         $searchInput.appendTo($searchForm);
124 |         $searchForm.prependTo(gitbook.state.$book.find('.book-summary'));
125 |     }
126 | 
127 |     // Return true if search is open
128 |     function isSearchOpen() {
129 |         return gitbook.state.$book.hasClass("with-search");
130 |     }
131 | 
132 |     // Toggle the search
133 |     function toggleSearch(_state) {
134 |         if (isSearchOpen() === _state) return;
135 |         if (!$searchInput) return;
136 | 
137 |         gitbook.state.$book.toggleClass("with-search", _state);
138 | 
139 |         // If search bar is open: focus input
140 |         if (isSearchOpen()) {
141 |             gitbook.sidebar.toggle(true);
142 |             $searchInput.focus();
143 |         } else {
144 |             $searchInput.blur();
145 |             $searchInput.val("");
146 |             gitbook.storage.remove("keyword");
147 |             gitbook.sidebar.filter(null);
148 |             $('.page-inner').unhighlight(hiOpts);
149 |         }
150 |     }
151 | 
152 |     function sidebarFilter(results) {
153 |         gitbook.sidebar.filter(_.pluck(results, "path"));
154 |         toc_visible = $('ul.summary').find('li:visible');
155 |     }
156 | 
157 |     // Recover current search when page changed
158 |     function recoverSearch() {
159 |         var keyword = gitbook.storage.get("keyword", "");
160 | 
161 |         createForm(keyword);
162 | 
163 |         if (keyword.length > 0) {
164 |             if(!isSearchOpen()) {
165 |                 toggleSearch(true); // [Yihui] open the search box
166 |             }
167 |             sidebarFilter(search(keyword));
168 |         }
169 |     }
170 | 
171 | 
172 |     gitbook.events.bind("start", function(e, config) {
173 |         // [Yihui] disable search
174 |         if (config.search === false) return;
175 |         collapse = !config.toc || config.toc.collapse === 'section' ||
176 |           config.toc.collapse === 'subsection';
177 | 
178 |         // Pre-fetch search index and create the form
179 |         fetchIndex()
180 |         // [Yihui] recover search after the page is loaded
181 |         .then(recoverSearch);
182 | 
183 | 
184 |         // Type in search bar
185 |         $(document).on("keyup", ".book-search input", function(e) {
186 |             var key = (e.keyCode ? e.keyCode : e.which);
187 |             // [Yihui] Escape -> close search box; Up/Down/Enter: previous/next highlighted
188 |             if (key == 27) {
189 |                 e.preventDefault();
190 |                 toggleSearch(false);
191 |             } else if (key == 38) {
192 |               scrollToHighlighted(-1);
193 |             } else if (key == 40 || key == 13) {
194 |               scrollToHighlighted(1);
195 |             }
196 |         }).on("input", ".book-search input", function(e) {
197 |             var q = $(this).val().trim();
198 |             if (q.length === 0) {
199 |                 gitbook.sidebar.filter(null);
200 |                 gitbook.storage.remove("keyword");
201 |                 $('.page-inner').unhighlight(hiOpts);
202 |             } else {
203 |                 var results = search(q);
204 |                 sidebarFilter(results);
205 |                 gitbook.storage.set("keyword", q);
206 |             }
207 |         });
208 | 
209 |         // Create the toggle search button
210 |         gitbook.toolbar.createButton({
211 |             icon: 'fa fa-search',
212 |             label: 'Search',
213 |             position: 'left',
214 |             onClick: toggleSearch
215 |         });
216 | 
217 |         // Bind keyboard to toggle search
218 |         gitbook.keyboard.bind(['f'], toggleSearch);
219 |     });
220 | 
221 |     // [Yihui] do not try to recover search; always start fresh
222 |     // gitbook.events.bind("page.change", recoverSearch);
223 | });
224 | 


--------------------------------------------------------------------------------
/libs/gitbook-2.6.7/css/plugin-fontsettings.css:
--------------------------------------------------------------------------------
  1 | /*
  2 |  * Theme 1
  3 |  */
  4 | .color-theme-1 .dropdown-menu {
  5 |   background-color: #111111;
  6 |   border-color: #7e888b;
  7 | }
  8 | .color-theme-1 .dropdown-menu .dropdown-caret .caret-inner {
  9 |   border-bottom: 9px solid #111111;
 10 | }
 11 | .color-theme-1 .dropdown-menu .buttons {
 12 |   border-color: #7e888b;
 13 | }
 14 | .color-theme-1 .dropdown-menu .button {
 15 |   color: #afa790;
 16 | }
 17 | .color-theme-1 .dropdown-menu .button:hover {
 18 |   color: #73553c;
 19 | }
 20 | /*
 21 |  * Theme 2
 22 |  */
 23 | .color-theme-2 .dropdown-menu {
 24 |   background-color: #2d3143;
 25 |   border-color: #272a3a;
 26 | }
 27 | .color-theme-2 .dropdown-menu .dropdown-caret .caret-inner {
 28 |   border-bottom: 9px solid #2d3143;
 29 | }
 30 | .color-theme-2 .dropdown-menu .buttons {
 31 |   border-color: #272a3a;
 32 | }
 33 | .color-theme-2 .dropdown-menu .button {
 34 |   color: #62677f;
 35 | }
 36 | .color-theme-2 .dropdown-menu .button:hover {
 37 |   color: #f4f4f5;
 38 | }
 39 | .book .book-header .font-settings .font-enlarge {
 40 |   line-height: 30px;
 41 |   font-size: 1.4em;
 42 | }
 43 | .book .book-header .font-settings .font-reduce {
 44 |   line-height: 30px;
 45 |   font-size: 1em;
 46 | }
 47 | .book.color-theme-1 .book-body {
 48 |   color: #704214;
 49 |   background: #f3eacb;
 50 | }
 51 | .book.color-theme-1 .book-body .page-wrapper .page-inner section {
 52 |   background: #f3eacb;
 53 | }
 54 | .book.color-theme-2 .book-body {
 55 |   color: #bdcadb;
 56 |   background: #1c1f2b;
 57 | }
 58 | .book.color-theme-2 .book-body .page-wrapper .page-inner section {
 59 |   background: #1c1f2b;
 60 | }
 61 | .book.font-size-0 .book-body .page-inner section {
 62 |   font-size: 1.2rem;
 63 | }
 64 | .book.font-size-1 .book-body .page-inner section {
 65 |   font-size: 1.4rem;
 66 | }
 67 | .book.font-size-2 .book-body .page-inner section {
 68 |   font-size: 1.6rem;
 69 | }
 70 | .book.font-size-3 .book-body .page-inner section {
 71 |   font-size: 2.2rem;
 72 | }
 73 | .book.font-size-4 .book-body .page-inner section {
 74 |   font-size: 4rem;
 75 | }
 76 | .book.font-family-0 {
 77 |   font-family: Georgia, serif;
 78 | }
 79 | .book.font-family-1 {
 80 |   font-family: "Helvetica Neue", Helvetica, Arial, sans-serif;
 81 | }
 82 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal {
 83 |   color: #704214;
 84 | }
 85 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal a {
 86 |   color: inherit;
 87 | }
 88 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal h1,
 89 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal h2,
 90 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal h3,
 91 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal h4,
 92 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal h5,
 93 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal h6 {
 94 |   color: inherit;
 95 | }
 96 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal h1,
 97 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal h2 {
 98 |   border-color: inherit;
 99 | }
100 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal h6 {
101 |   color: inherit;
102 | }
103 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal hr {
104 |   background-color: inherit;
105 | }
106 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal blockquote {
107 |   border-color: #c4b29f;
108 |   opacity: 0.9;
109 | }
110 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal pre,
111 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal code {
112 |   background: #fdf6e3;
113 |   color: #657b83;
114 |   border-color: #f8df9c;
115 | }
116 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal .highlight {
117 |   background-color: inherit;
118 | }
119 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal table th,
120 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal table td {
121 |   border-color: #f5d06c;
122 | }
123 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal table tr {
124 |   color: inherit;
125 |   background-color: #fdf6e3;
126 |   border-color: #444444;
127 | }
128 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal table tr:nth-child(2n) {
129 |   background-color: #fbeecb;
130 | }
131 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal {
132 |   color: #bdcadb;
133 | }
134 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal a {
135 |   color: #3eb1d0;
136 | }
137 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal h1,
138 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal h2,
139 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal h3,
140 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal h4,
141 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal h5,
142 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal h6 {
143 |   color: #fffffa;
144 | }
145 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal h1,
146 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal h2 {
147 |   border-color: #373b4e;
148 | }
149 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal h6 {
150 |   color: #373b4e;
151 | }
152 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal hr {
153 |   background-color: #373b4e;
154 | }
155 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal blockquote {
156 |   border-color: #373b4e;
157 | }
158 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal pre,
159 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal code {
160 |   color: #9dbed8;
161 |   background: #2d3143;
162 |   border-color: #2d3143;
163 | }
164 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal .highlight {
165 |   background-color: #282a39;
166 | }
167 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal table th,
168 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal table td {
169 |   border-color: #3b3f54;
170 | }
171 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal table tr {
172 |   color: #b6c2d2;
173 |   background-color: #2d3143;
174 |   border-color: #3b3f54;
175 | }
176 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal table tr:nth-child(2n) {
177 |   background-color: #35394b;
178 | }
179 | .book.color-theme-1 .book-header {
180 |   color: #afa790;
181 |   background: transparent;
182 | }
183 | .book.color-theme-1 .book-header .btn {
184 |   color: #afa790;
185 | }
186 | .book.color-theme-1 .book-header .btn:hover {
187 |   color: #73553c;
188 |   background: none;
189 | }
190 | .book.color-theme-1 .book-header h1 {
191 |   color: #704214;
192 | }
193 | .book.color-theme-2 .book-header {
194 |   color: #7e888b;
195 |   background: transparent;
196 | }
197 | .book.color-theme-2 .book-header .btn {
198 |   color: #3b3f54;
199 | }
200 | .book.color-theme-2 .book-header .btn:hover {
201 |   color: #fffff5;
202 |   background: none;
203 | }
204 | .book.color-theme-2 .book-header h1 {
205 |   color: #bdcadb;
206 | }
207 | .book.color-theme-1 .book-body .navigation {
208 |   color: #afa790;
209 | }
210 | .book.color-theme-1 .book-body .navigation:hover {
211 |   color: #73553c;
212 | }
213 | .book.color-theme-2 .book-body .navigation {
214 |   color: #383f52;
215 | }
216 | .book.color-theme-2 .book-body .navigation:hover {
217 |   color: #fffff5;
218 | }
219 | /*
220 |  * Theme 1
221 |  */
222 | .book.color-theme-1 .book-summary {
223 |   color: #afa790;
224 |   background: #111111;
225 |   border-right: 1px solid rgba(0, 0, 0, 0.07);
226 | }
227 | .book.color-theme-1 .book-summary .book-search {
228 |   background: transparent;
229 | }
230 | .book.color-theme-1 .book-summary .book-search input,
231 | .book.color-theme-1 .book-summary .book-search input:focus {
232 |   border: 1px solid transparent;
233 | }
234 | .book.color-theme-1 .book-summary ul.summary li.divider {
235 |   background: #7e888b;
236 |   box-shadow: none;
237 | }
238 | .book.color-theme-1 .book-summary ul.summary li i.fa-check {
239 |   color: #33cc33;
240 | }
241 | .book.color-theme-1 .book-summary ul.summary li.done > a {
242 |   color: #877f6a;
243 | }
244 | .book.color-theme-1 .book-summary ul.summary li a,
245 | .book.color-theme-1 .book-summary ul.summary li span {
246 |   color: #877f6a;
247 |   background: transparent;
248 |   font-weight: normal;
249 | }
250 | .book.color-theme-1 .book-summary ul.summary li.active > a,
251 | .book.color-theme-1 .book-summary ul.summary li a:hover {
252 |   color: #704214;
253 |   background: transparent;
254 |   font-weight: normal;
255 | }
256 | /*
257 |  * Theme 2
258 |  */
259 | .book.color-theme-2 .book-summary {
260 |   color: #bcc1d2;
261 |   background: #2d3143;
262 |   border-right: none;
263 | }
264 | .book.color-theme-2 .book-summary .book-search {
265 |   background: transparent;
266 | }
267 | .book.color-theme-2 .book-summary .book-search input,
268 | .book.color-theme-2 .book-summary .book-search input:focus {
269 |   border: 1px solid transparent;
270 | }
271 | .book.color-theme-2 .book-summary ul.summary li.divider {
272 |   background: #272a3a;
273 |   box-shadow: none;
274 | }
275 | .book.color-theme-2 .book-summary ul.summary li i.fa-check {
276 |   color: #33cc33;
277 | }
278 | .book.color-theme-2 .book-summary ul.summary li.done > a {
279 |   color: #62687f;
280 | }
281 | .book.color-theme-2 .book-summary ul.summary li a,
282 | .book.color-theme-2 .book-summary ul.summary li span {
283 |   color: #c1c6d7;
284 |   background: transparent;
285 |   font-weight: 600;
286 | }
287 | .book.color-theme-2 .book-summary ul.summary li.active > a,
288 | .book.color-theme-2 .book-summary ul.summary li a:hover {
289 |   color: #f4f4f5;
290 |   background: #252737;
291 |   font-weight: 600;
292 | }
293 | 


--------------------------------------------------------------------------------
/analysis/libs/gitbook-2.6.7/css/plugin-fontsettings.css:
--------------------------------------------------------------------------------
  1 | /*
  2 |  * Theme 1
  3 |  */
  4 | .color-theme-1 .dropdown-menu {
  5 |   background-color: #111111;
  6 |   border-color: #7e888b;
  7 | }
  8 | .color-theme-1 .dropdown-menu .dropdown-caret .caret-inner {
  9 |   border-bottom: 9px solid #111111;
 10 | }
 11 | .color-theme-1 .dropdown-menu .buttons {
 12 |   border-color: #7e888b;
 13 | }
 14 | .color-theme-1 .dropdown-menu .button {
 15 |   color: #afa790;
 16 | }
 17 | .color-theme-1 .dropdown-menu .button:hover {
 18 |   color: #73553c;
 19 | }
 20 | /*
 21 |  * Theme 2
 22 |  */
 23 | .color-theme-2 .dropdown-menu {
 24 |   background-color: #2d3143;
 25 |   border-color: #272a3a;
 26 | }
 27 | .color-theme-2 .dropdown-menu .dropdown-caret .caret-inner {
 28 |   border-bottom: 9px solid #2d3143;
 29 | }
 30 | .color-theme-2 .dropdown-menu .buttons {
 31 |   border-color: #272a3a;
 32 | }
 33 | .color-theme-2 .dropdown-menu .button {
 34 |   color: #62677f;
 35 | }
 36 | .color-theme-2 .dropdown-menu .button:hover {
 37 |   color: #f4f4f5;
 38 | }
 39 | .book .book-header .font-settings .font-enlarge {
 40 |   line-height: 30px;
 41 |   font-size: 1.4em;
 42 | }
 43 | .book .book-header .font-settings .font-reduce {
 44 |   line-height: 30px;
 45 |   font-size: 1em;
 46 | }
 47 | .book.color-theme-1 .book-body {
 48 |   color: #704214;
 49 |   background: #f3eacb;
 50 | }
 51 | .book.color-theme-1 .book-body .page-wrapper .page-inner section {
 52 |   background: #f3eacb;
 53 | }
 54 | .book.color-theme-2 .book-body {
 55 |   color: #bdcadb;
 56 |   background: #1c1f2b;
 57 | }
 58 | .book.color-theme-2 .book-body .page-wrapper .page-inner section {
 59 |   background: #1c1f2b;
 60 | }
 61 | .book.font-size-0 .book-body .page-inner section {
 62 |   font-size: 1.2rem;
 63 | }
 64 | .book.font-size-1 .book-body .page-inner section {
 65 |   font-size: 1.4rem;
 66 | }
 67 | .book.font-size-2 .book-body .page-inner section {
 68 |   font-size: 1.6rem;
 69 | }
 70 | .book.font-size-3 .book-body .page-inner section {
 71 |   font-size: 2.2rem;
 72 | }
 73 | .book.font-size-4 .book-body .page-inner section {
 74 |   font-size: 4rem;
 75 | }
 76 | .book.font-family-0 {
 77 |   font-family: Georgia, serif;
 78 | }
 79 | .book.font-family-1 {
 80 |   font-family: "Helvetica Neue", Helvetica, Arial, sans-serif;
 81 | }
 82 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal {
 83 |   color: #704214;
 84 | }
 85 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal a {
 86 |   color: inherit;
 87 | }
 88 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal h1,
 89 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal h2,
 90 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal h3,
 91 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal h4,
 92 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal h5,
 93 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal h6 {
 94 |   color: inherit;
 95 | }
 96 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal h1,
 97 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal h2 {
 98 |   border-color: inherit;
 99 | }
100 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal h6 {
101 |   color: inherit;
102 | }
103 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal hr {
104 |   background-color: inherit;
105 | }
106 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal blockquote {
107 |   border-color: #c4b29f;
108 |   opacity: 0.9;
109 | }
110 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal pre,
111 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal code {
112 |   background: #fdf6e3;
113 |   color: #657b83;
114 |   border-color: #f8df9c;
115 | }
116 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal .highlight {
117 |   background-color: inherit;
118 | }
119 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal table th,
120 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal table td {
121 |   border-color: #f5d06c;
122 | }
123 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal table tr {
124 |   color: inherit;
125 |   background-color: #fdf6e3;
126 |   border-color: #444444;
127 | }
128 | .book.color-theme-1 .book-body .page-wrapper .page-inner section.normal table tr:nth-child(2n) {
129 |   background-color: #fbeecb;
130 | }
131 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal {
132 |   color: #bdcadb;
133 | }
134 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal a {
135 |   color: #3eb1d0;
136 | }
137 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal h1,
138 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal h2,
139 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal h3,
140 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal h4,
141 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal h5,
142 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal h6 {
143 |   color: #fffffa;
144 | }
145 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal h1,
146 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal h2 {
147 |   border-color: #373b4e;
148 | }
149 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal h6 {
150 |   color: #373b4e;
151 | }
152 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal hr {
153 |   background-color: #373b4e;
154 | }
155 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal blockquote {
156 |   border-color: #373b4e;
157 | }
158 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal pre,
159 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal code {
160 |   color: #9dbed8;
161 |   background: #2d3143;
162 |   border-color: #2d3143;
163 | }
164 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal .highlight {
165 |   background-color: #282a39;
166 | }
167 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal table th,
168 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal table td {
169 |   border-color: #3b3f54;
170 | }
171 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal table tr {
172 |   color: #b6c2d2;
173 |   background-color: #2d3143;
174 |   border-color: #3b3f54;
175 | }
176 | .book.color-theme-2 .book-body .page-wrapper .page-inner section.normal table tr:nth-child(2n) {
177 |   background-color: #35394b;
178 | }
179 | .book.color-theme-1 .book-header {
180 |   color: #afa790;
181 |   background: transparent;
182 | }
183 | .book.color-theme-1 .book-header .btn {
184 |   color: #afa790;
185 | }
186 | .book.color-theme-1 .book-header .btn:hover {
187 |   color: #73553c;
188 |   background: none;
189 | }
190 | .book.color-theme-1 .book-header h1 {
191 |   color: #704214;
192 | }
193 | .book.color-theme-2 .book-header {
194 |   color: #7e888b;
195 |   background: transparent;
196 | }
197 | .book.color-theme-2 .book-header .btn {
198 |   color: #3b3f54;
199 | }
200 | .book.color-theme-2 .book-header .btn:hover {
201 |   color: #fffff5;
202 |   background: none;
203 | }
204 | .book.color-theme-2 .book-header h1 {
205 |   color: #bdcadb;
206 | }
207 | .book.color-theme-1 .book-body .navigation {
208 |   color: #afa790;
209 | }
210 | .book.color-theme-1 .book-body .navigation:hover {
211 |   color: #73553c;
212 | }
213 | .book.color-theme-2 .book-body .navigation {
214 |   color: #383f52;
215 | }
216 | .book.color-theme-2 .book-body .navigation:hover {
217 |   color: #fffff5;
218 | }
219 | /*
220 |  * Theme 1
221 |  */
222 | .book.color-theme-1 .book-summary {
223 |   color: #afa790;
224 |   background: #111111;
225 |   border-right: 1px solid rgba(0, 0, 0, 0.07);
226 | }
227 | .book.color-theme-1 .book-summary .book-search {
228 |   background: transparent;
229 | }
230 | .book.color-theme-1 .book-summary .book-search input,
231 | .book.color-theme-1 .book-summary .book-search input:focus {
232 |   border: 1px solid transparent;
233 | }
234 | .book.color-theme-1 .book-summary ul.summary li.divider {
235 |   background: #7e888b;
236 |   box-shadow: none;
237 | }
238 | .book.color-theme-1 .book-summary ul.summary li i.fa-check {
239 |   color: #33cc33;
240 | }
241 | .book.color-theme-1 .book-summary ul.summary li.done > a {
242 |   color: #877f6a;
243 | }
244 | .book.color-theme-1 .book-summary ul.summary li a,
245 | .book.color-theme-1 .book-summary ul.summary li span {
246 |   color: #877f6a;
247 |   background: transparent;
248 |   font-weight: normal;
249 | }
250 | .book.color-theme-1 .book-summary ul.summary li.active > a,
251 | .book.color-theme-1 .book-summary ul.summary li a:hover {
252 |   color: #704214;
253 |   background: transparent;
254 |   font-weight: normal;
255 | }
256 | /*
257 |  * Theme 2
258 |  */
259 | .book.color-theme-2 .book-summary {
260 |   color: #bcc1d2;
261 |   background: #2d3143;
262 |   border-right: none;
263 | }
264 | .book.color-theme-2 .book-summary .book-search {
265 |   background: transparent;
266 | }
267 | .book.color-theme-2 .book-summary .book-search input,
268 | .book.color-theme-2 .book-summary .book-search input:focus {
269 |   border: 1px solid transparent;
270 | }
271 | .book.color-theme-2 .book-summary ul.summary li.divider {
272 |   background: #272a3a;
273 |   box-shadow: none;
274 | }
275 | .book.color-theme-2 .book-summary ul.summary li i.fa-check {
276 |   color: #33cc33;
277 | }
278 | .book.color-theme-2 .book-summary ul.summary li.done > a {
279 |   color: #62687f;
280 | }
281 | .book.color-theme-2 .book-summary ul.summary li a,
282 | .book.color-theme-2 .book-summary ul.summary li span {
283 |   color: #c1c6d7;
284 |   background: transparent;
285 |   font-weight: 600;
286 | }
287 | .book.color-theme-2 .book-summary ul.summary li.active > a,
288 | .book.color-theme-2 .book-summary ul.summary li a:hover {
289 |   color: #f4f4f5;
290 |   background: #252737;
291 |   font-weight: 600;
292 | }
293 | 


--------------------------------------------------------------------------------
/libs/gitbook-2.6.7/js/plugin-bookdown.js:
--------------------------------------------------------------------------------
  1 | gitbook.require(["gitbook", "lodash", "jQuery"], function(gitbook, _, $) {
  2 | 
  3 |   var gs = gitbook.storage;
  4 | 
  5 |   gitbook.events.bind("start", function(e, config) {
  6 | 
  7 |     // add the Edit button (edit on Github)
  8 |     var edit = config.edit;
  9 |     if (edit && edit.link) gitbook.toolbar.createButton({
 10 |       icon: 'fa fa-edit',
 11 |       label: edit.text || 'Edit',
 12 |       position: 'left',
 13 |       onClick: function(e) {
 14 |         e.preventDefault();
 15 |         window.open(edit.link);
 16 |       }
 17 |     });
 18 | 
 19 |     // add the History button (file history on Github)
 20 |     var history = config.history;
 21 |     if (history && history.link) gitbook.toolbar.createButton({
 22 |       icon: 'fa fa-history',
 23 |       label: history.text || 'History',
 24 |       position: 'left',
 25 |       onClick: function(e) {
 26 |         e.preventDefault();
 27 |         window.open(history.link);
 28 |       }
 29 |     });
 30 | 
 31 |     // add the View button (file view on Github)
 32 |     var view = config.view;
 33 |     if (view && view.link) gitbook.toolbar.createButton({
 34 |       icon: 'fa fa-eye',
 35 |       label: view.text || 'View Source',
 36 |       position: 'left',
 37 |       onClick: function(e) {
 38 |         e.preventDefault();
 39 |         window.open(view.link);
 40 |       }
 41 |     });
 42 | 
 43 |     // add the Download button
 44 |     var down = config.download;
 45 |     var normalizeDownload = function() {
 46 |       if (!down || !(down instanceof Array) || down.length === 0) return;
 47 |       if (down[0] instanceof Array) return down;
 48 |       return $.map(down, function(file, i) {
 49 |         return [[file, file.replace(/.*[.]/g, '').toUpperCase()]];
 50 |       });
 51 |     };
 52 |     down = normalizeDownload(down);
 53 |     if (down) if (down.length === 1 && /[.]pdf$/.test(down[0][0])) {
 54 |       gitbook.toolbar.createButton({
 55 |         icon: 'fa fa-file-pdf-o',
 56 |         label: down[0][1],
 57 |         position: 'left',
 58 |         onClick: function(e) {
 59 |           e.preventDefault();
 60 |           window.open(down[0][0]);
 61 |         }
 62 |       });
 63 |     } else {
 64 |       gitbook.toolbar.createButton({
 65 |         icon: 'fa fa-download',
 66 |         label: 'Download',
 67 |         position: 'left',
 68 |         dropdown: $.map(down, function(item, i) {
 69 |           return {
 70 |             text: item[1],
 71 |             onClick: function(e) {
 72 |               e.preventDefault();
 73 |               window.open(item[0]);
 74 |             }
 75 |           };
 76 |         })
 77 |       });
 78 |     }
 79 | 
 80 |     // add the Information button
 81 |     var info = ['Keyboard shortcuts (<> indicates arrow keys):',
 82 |       '<left>/<right>: navigate to previous/next page',
 83 |       's: Toggle sidebar'];
 84 |     if (config.search !== false) info.push('f: Toggle search input ' +
 85 |       '(use <up>/<down>/Enter in the search input to navigate through search matches; ' +
 86 |       'press Esc to cancel search)');
 87 |     if (config.info !== false) gitbook.toolbar.createButton({
 88 |       icon: 'fa fa-info',
 89 |       label: 'Information about the toolbar',
 90 |       position: 'left',
 91 |       onClick: function(e) {
 92 |         e.preventDefault();
 93 |         window.alert(info.join('\n\n'));
 94 |       }
 95 |     });
 96 | 
 97 |     // highlight the current section in TOC
 98 |     var href = window.location.pathname;
 99 |     href = href.substr(href.lastIndexOf('/') + 1);
100 |     // accentuated characters need to be decoded (#819)
101 |     href = decodeURIComponent(href);
102 |     if (href === '') href = 'index.html';
103 |     var li = $('a[href^="' + href + location.hash + '"]').parent('li.chapter').first();
104 |     var summary = $('ul.summary'), chaps = summary.find('li.chapter');
105 |     if (li.length === 0) li = chaps.first();
106 |     li.addClass('active');
107 |     chaps.on('click', function(e) {
108 |       chaps.removeClass('active');
109 |       $(this).addClass('active');
110 |       gs.set('tocScrollTop', summary.scrollTop());
111 |     });
112 | 
113 |     var toc = config.toc;
114 |     // collapse TOC items that are not for the current chapter
115 |     if (toc && toc.collapse) (function() {
116 |       var type = toc.collapse;
117 |       if (type === 'none') return;
118 |       if (type !== 'section' && type !== 'subsection') return;
119 |       // sections under chapters
120 |       var toc_sub = summary.children('li[data-level]').children('ul');
121 |       if (type === 'section') {
122 |         toc_sub.hide()
123 |           .parent().has(li).children('ul').show();
124 |       } else {
125 |         toc_sub.children('li').children('ul').hide()
126 |           .parent().has(li).children('ul').show();
127 |       }
128 |       li.children('ul').show();
129 |       var toc_sub2 = toc_sub.children('li');
130 |       if (type === 'section') toc_sub2.children('ul').hide();
131 |       summary.children('li[data-level]').find('a')
132 |         .on('click.bookdown', function(e) {
133 |           if (href === $(this).attr('href').replace(/#.*/, ''))
134 |             $(this).parent('li').children('ul').toggle();
135 |         });
136 |     })();
137 | 
138 |     // add tooltips to the <a>'s that are truncated
139 |     $('a').each(function(i, el) {
140 |       if (el.offsetWidth >= el.scrollWidth) return;
141 |       if (typeof el.title === 'undefined') return;
142 |       el.title = el.text;
143 |     });
144 | 
145 |     // restore TOC scroll position
146 |     var pos = gs.get('tocScrollTop');
147 |     if (typeof pos !== 'undefined') summary.scrollTop(pos);
148 | 
149 |     // highlight the TOC item that has same text as the heading in view as scrolling
150 |     if (toc && toc.scroll_highlight !== false) (function() {
151 |       // scroll the current TOC item into viewport
152 |       var ht = $(window).height(), rect = li[0].getBoundingClientRect();
153 |       if (rect.top >= ht || rect.top <= 0 || rect.bottom <= 0) {
154 |         summary.scrollTop(li[0].offsetTop);
155 |       }
156 |       // current chapter TOC items
157 |       var items = $('a[href^="' + href + '"]').parent('li.chapter'),
158 |           m = items.length;
159 |       if (m === 0) {
160 |         items = summary.find('li.chapter');
161 |         m = items.length;
162 |       }
163 |       if (m === 0) return;
164 |       // all section titles on current page
165 |       var hs = bookInner.find('.page-inner').find('h1,h2,h3'), n = hs.length,
166 |           ts = hs.map(function(i, el) { return $(el).text(); });
167 |       if (n === 0) return;
168 |       var scrollHandler = function(e) {
169 |         var ht = $(window).height();
170 |         clearTimeout($.data(this, 'scrollTimer'));
171 |         $.data(this, 'scrollTimer', setTimeout(function() {
172 |           // find the first visible title in the viewport
173 |           for (var i = 0; i < n; i++) {
174 |             var rect = hs[i].getBoundingClientRect();
175 |             if (rect.top >= 0 && rect.bottom <= ht) break;
176 |           }
177 |           if (i === n) return;
178 |           items.removeClass('active');
179 |           for (var j = 0; j < m; j++) {
180 |             if (items.eq(j).children('a').first().text() === ts[i]) break;
181 |           }
182 |           if (j === m) j = 0;  // highlight the chapter title
183 |           // search bottom-up for a visible TOC item to highlight; if an item is
184 |           // hidden, we check if its parent is visible, and so on
185 |           while (j > 0 && items.eq(j).is(':hidden')) j--;
186 |           items.eq(j).addClass('active');
187 |         }, 250));
188 |       };
189 |       bookInner.on('scroll.bookdown', scrollHandler);
190 |       bookBody.on('scroll.bookdown', scrollHandler);
191 |     })();
192 | 
193 |     // do not refresh the page if the TOC item points to the current page
194 |     $('a[href="' + href + '"]').parent('li.chapter').children('a')
195 |       .on('click', function(e) {
196 |         bookInner.scrollTop(0);
197 |         bookBody.scrollTop(0);
198 |         return false;
199 |       });
200 | 
201 |     var toolbar = config.toolbar;
202 |     if (!toolbar || toolbar.position !== 'static') {
203 |       var bookHeader = $('.book-header');
204 |       bookBody.addClass('fixed');
205 |       bookHeader.addClass('fixed')
206 |       .css('background-color', bookBody.css('background-color'))
207 |       .on('click.bookdown', function(e) {
208 |         // the theme may have changed after user clicks the theme button
209 |         bookHeader.css('background-color', bookBody.css('background-color'));
210 |       });
211 |     }
212 | 
213 |   });
214 | 
215 |   gitbook.events.bind("page.change", function(e) {
216 |     // store TOC scroll position
217 |     var summary = $('ul.summary');
218 |     gs.set('tocScrollTop', summary.scrollTop());
219 |   });
220 | 
221 |   var bookBody = $('.book-body'), bookInner = bookBody.find('.body-inner');
222 |   var chapterTitle = function() {
223 |     return bookInner.find('.page-inner').find('h1,h2').first().text();
224 |   };
225 |   var saveScrollPos = function(e) {
226 |     // save scroll position before page is reloaded
227 |     gs.set('bodyScrollTop', {
228 |       body: bookBody.scrollTop(),
229 |       inner: bookInner.scrollTop(),
230 |       focused: document.hasFocus(),
231 |       title: chapterTitle()
232 |     });
233 |   };
234 |   $(document).on('servr:reload', saveScrollPos);
235 | 
236 |   // check if the page is loaded in an iframe (e.g. the RStudio preview window)
237 |   var inIFrame = function() {
238 |     var inIframe = true;
239 |     try { inIframe = window.self !== window.top; } catch (e) {}
240 |     return inIframe;
241 |   };
242 |   if (inIFrame()) {
243 |     $(window).on('blur unload', saveScrollPos);
244 |   }
245 | 
246 |   $(function(e) {
247 |     var pos = gs.get('bodyScrollTop');
248 |     if (pos) {
249 |       if (pos.title === chapterTitle()) {
250 |         if (pos.body !== 0) bookBody.scrollTop(pos.body);
251 |         if (pos.inner !== 0) bookInner.scrollTop(pos.inner);
252 |       }
253 |     }
254 |     if ((pos && pos.focused) || !inIFrame()) bookInner.find('.page-wrapper').focus();
255 |     // clear book body scroll position
256 |     gs.remove('bodyScrollTop');
257 |   });
258 | 
259 | });
260 | 


--------------------------------------------------------------------------------
/analysis/libs/gitbook-2.6.7/js/plugin-bookdown.js:
--------------------------------------------------------------------------------
  1 | gitbook.require(["gitbook", "lodash", "jQuery"], function(gitbook, _, $) {
  2 | 
  3 |   var gs = gitbook.storage;
  4 | 
  5 |   gitbook.events.bind("start", function(e, config) {
  6 | 
  7 |     // add the Edit button (edit on Github)
  8 |     var edit = config.edit;
  9 |     if (edit && edit.link) gitbook.toolbar.createButton({
 10 |       icon: 'fa fa-edit',
 11 |       label: edit.text || 'Edit',
 12 |       position: 'left',
 13 |       onClick: function(e) {
 14 |         e.preventDefault();
 15 |         window.open(edit.link);
 16 |       }
 17 |     });
 18 | 
 19 |     // add the History button (file history on Github)
 20 |     var history = config.history;
 21 |     if (history && history.link) gitbook.toolbar.createButton({
 22 |       icon: 'fa fa-history',
 23 |       label: history.text || 'History',
 24 |       position: 'left',
 25 |       onClick: function(e) {
 26 |         e.preventDefault();
 27 |         window.open(history.link);
 28 |       }
 29 |     });
 30 | 
 31 |     // add the View button (file view on Github)
 32 |     var view = config.view;
 33 |     if (view && view.link) gitbook.toolbar.createButton({
 34 |       icon: 'fa fa-eye',
 35 |       label: view.text || 'View Source',
 36 |       position: 'left',
 37 |       onClick: function(e) {
 38 |         e.preventDefault();
 39 |         window.open(view.link);
 40 |       }
 41 |     });
 42 | 
 43 |     // add the Download button
 44 |     var down = config.download;
 45 |     var normalizeDownload = function() {
 46 |       if (!down || !(down instanceof Array) || down.length === 0) return;
 47 |       if (down[0] instanceof Array) return down;
 48 |       return $.map(down, function(file, i) {
 49 |         return [[file, file.replace(/.*[.]/g, '').toUpperCase()]];
 50 |       });
 51 |     };
 52 |     down = normalizeDownload(down);
 53 |     if (down) if (down.length === 1 && /[.]pdf$/.test(down[0][0])) {
 54 |       gitbook.toolbar.createButton({
 55 |         icon: 'fa fa-file-pdf-o',
 56 |         label: down[0][1],
 57 |         position: 'left',
 58 |         onClick: function(e) {
 59 |           e.preventDefault();
 60 |           window.open(down[0][0]);
 61 |         }
 62 |       });
 63 |     } else {
 64 |       gitbook.toolbar.createButton({
 65 |         icon: 'fa fa-download',
 66 |         label: 'Download',
 67 |         position: 'left',
 68 |         dropdown: $.map(down, function(item, i) {
 69 |           return {
 70 |             text: item[1],
 71 |             onClick: function(e) {
 72 |               e.preventDefault();
 73 |               window.open(item[0]);
 74 |             }
 75 |           };
 76 |         })
 77 |       });
 78 |     }
 79 | 
 80 |     // add the Information button
 81 |     var info = ['Keyboard shortcuts (<> indicates arrow keys):',
 82 |       '<left>/<right>: navigate to previous/next page',
 83 |       's: Toggle sidebar'];
 84 |     if (config.search !== false) info.push('f: Toggle search input ' +
 85 |       '(use <up>/<down>/Enter in the search input to navigate through search matches; ' +
 86 |       'press Esc to cancel search)');
 87 |     if (config.info !== false) gitbook.toolbar.createButton({
 88 |       icon: 'fa fa-info',
 89 |       label: 'Information about the toolbar',
 90 |       position: 'left',
 91 |       onClick: function(e) {
 92 |         e.preventDefault();
 93 |         window.alert(info.join('\n\n'));
 94 |       }
 95 |     });
 96 | 
 97 |     // highlight the current section in TOC
 98 |     var href = window.location.pathname;
 99 |     href = href.substr(href.lastIndexOf('/') + 1);
100 |     // accentuated characters need to be decoded (#819)
101 |     href = decodeURIComponent(href);
102 |     if (href === '') href = 'index.html';
103 |     var li = $('a[href^="' + href + location.hash + '"]').parent('li.chapter').first();
104 |     var summary = $('ul.summary'), chaps = summary.find('li.chapter');
105 |     if (li.length === 0) li = chaps.first();
106 |     li.addClass('active');
107 |     chaps.on('click', function(e) {
108 |       chaps.removeClass('active');
109 |       $(this).addClass('active');
110 |       gs.set('tocScrollTop', summary.scrollTop());
111 |     });
112 | 
113 |     var toc = config.toc;
114 |     // collapse TOC items that are not for the current chapter
115 |     if (toc && toc.collapse) (function() {
116 |       var type = toc.collapse;
117 |       if (type === 'none') return;
118 |       if (type !== 'section' && type !== 'subsection') return;
119 |       // sections under chapters
120 |       var toc_sub = summary.children('li[data-level]').children('ul');
121 |       if (type === 'section') {
122 |         toc_sub.hide()
123 |           .parent().has(li).children('ul').show();
124 |       } else {
125 |         toc_sub.children('li').children('ul').hide()
126 |           .parent().has(li).children('ul').show();
127 |       }
128 |       li.children('ul').show();
129 |       var toc_sub2 = toc_sub.children('li');
130 |       if (type === 'section') toc_sub2.children('ul').hide();
131 |       summary.children('li[data-level]').find('a')
132 |         .on('click.bookdown', function(e) {
133 |           if (href === $(this).attr('href').replace(/#.*/, ''))
134 |             $(this).parent('li').children('ul').toggle();
135 |         });
136 |     })();
137 | 
138 |     // add tooltips to the <a>'s that are truncated
139 |     $('a').each(function(i, el) {
140 |       if (el.offsetWidth >= el.scrollWidth) return;
141 |       if (typeof el.title === 'undefined') return;
142 |       el.title = el.text;
143 |     });
144 | 
145 |     // restore TOC scroll position
146 |     var pos = gs.get('tocScrollTop');
147 |     if (typeof pos !== 'undefined') summary.scrollTop(pos);
148 | 
149 |     // highlight the TOC item that has same text as the heading in view as scrolling
150 |     if (toc && toc.scroll_highlight !== false) (function() {
151 |       // scroll the current TOC item into viewport
152 |       var ht = $(window).height(), rect = li[0].getBoundingClientRect();
153 |       if (rect.top >= ht || rect.top <= 0 || rect.bottom <= 0) {
154 |         summary.scrollTop(li[0].offsetTop);
155 |       }
156 |       // current chapter TOC items
157 |       var items = $('a[href^="' + href + '"]').parent('li.chapter'),
158 |           m = items.length;
159 |       if (m === 0) {
160 |         items = summary.find('li.chapter');
161 |         m = items.length;
162 |       }
163 |       if (m === 0) return;
164 |       // all section titles on current page
165 |       var hs = bookInner.find('.page-inner').find('h1,h2,h3'), n = hs.length,
166 |           ts = hs.map(function(i, el) { return $(el).text(); });
167 |       if (n === 0) return;
168 |       var scrollHandler = function(e) {
169 |         var ht = $(window).height();
170 |         clearTimeout($.data(this, 'scrollTimer'));
171 |         $.data(this, 'scrollTimer', setTimeout(function() {
172 |           // find the first visible title in the viewport
173 |           for (var i = 0; i < n; i++) {
174 |             var rect = hs[i].getBoundingClientRect();
175 |             if (rect.top >= 0 && rect.bottom <= ht) break;
176 |           }
177 |           if (i === n) return;
178 |           items.removeClass('active');
179 |           for (var j = 0; j < m; j++) {
180 |             if (items.eq(j).children('a').first().text() === ts[i]) break;
181 |           }
182 |           if (j === m) j = 0;  // highlight the chapter title
183 |           // search bottom-up for a visible TOC item to highlight; if an item is
184 |           // hidden, we check if its parent is visible, and so on
185 |           while (j > 0 && items.eq(j).is(':hidden')) j--;
186 |           items.eq(j).addClass('active');
187 |         }, 250));
188 |       };
189 |       bookInner.on('scroll.bookdown', scrollHandler);
190 |       bookBody.on('scroll.bookdown', scrollHandler);
191 |     })();
192 | 
193 |     // do not refresh the page if the TOC item points to the current page
194 |     $('a[href="' + href + '"]').parent('li.chapter').children('a')
195 |       .on('click', function(e) {
196 |         bookInner.scrollTop(0);
197 |         bookBody.scrollTop(0);
198 |         return false;
199 |       });
200 | 
201 |     var toolbar = config.toolbar;
202 |     if (!toolbar || toolbar.position !== 'static') {
203 |       var bookHeader = $('.book-header');
204 |       bookBody.addClass('fixed');
205 |       bookHeader.addClass('fixed')
206 |       .css('background-color', bookBody.css('background-color'))
207 |       .on('click.bookdown', function(e) {
208 |         // the theme may have changed after user clicks the theme button
209 |         bookHeader.css('background-color', bookBody.css('background-color'));
210 |       });
211 |     }
212 | 
213 |   });
214 | 
215 |   gitbook.events.bind("page.change", function(e) {
216 |     // store TOC scroll position
217 |     var summary = $('ul.summary');
218 |     gs.set('tocScrollTop', summary.scrollTop());
219 |   });
220 | 
221 |   var bookBody = $('.book-body'), bookInner = bookBody.find('.body-inner');
222 |   var chapterTitle = function() {
223 |     return bookInner.find('.page-inner').find('h1,h2').first().text();
224 |   };
225 |   var saveScrollPos = function(e) {
226 |     // save scroll position before page is reloaded
227 |     gs.set('bodyScrollTop', {
228 |       body: bookBody.scrollTop(),
229 |       inner: bookInner.scrollTop(),
230 |       focused: document.hasFocus(),
231 |       title: chapterTitle()
232 |     });
233 |   };
234 |   $(document).on('servr:reload', saveScrollPos);
235 | 
236 |   // check if the page is loaded in an iframe (e.g. the RStudio preview window)
237 |   var inIFrame = function() {
238 |     var inIframe = true;
239 |     try { inIframe = window.self !== window.top; } catch (e) {}
240 |     return inIframe;
241 |   };
242 |   if (inIFrame()) {
243 |     $(window).on('blur unload', saveScrollPos);
244 |   }
245 | 
246 |   $(function(e) {
247 |     var pos = gs.get('bodyScrollTop');
248 |     if (pos) {
249 |       if (pos.title === chapterTitle()) {
250 |         if (pos.body !== 0) bookBody.scrollTop(pos.body);
251 |         if (pos.inner !== 0) bookInner.scrollTop(pos.inner);
252 |       }
253 |     }
254 |     if ((pos && pos.focused) || !inIFrame()) bookInner.find('.page-wrapper').focus();
255 |     // clear book body scroll position
256 |     gs.remove('bodyScrollTop');
257 |   });
258 | 
259 | });
260 | 


--------------------------------------------------------------------------------
/libs/gitbook-2.6.7/js/clipboard.min.js:
--------------------------------------------------------------------------------
1 | /*!
2 |  * clipboard.js v2.0.4
3 |  * https://zenorocha.github.io/clipboard.js
4 |  *
5 |  * Licensed MIT © Zeno Rocha
6 |  */
7 | !function(t,e){"object"==typeof exports&&"object"==typeof module?module.exports=e():"function"==typeof define&&define.amd?define([],e):"object"==typeof exports?exports.ClipboardJS=e():t.ClipboardJS=e()}(this,function(){return function(n){var o={};function r(t){if(o[t])return o[t].exports;var e=o[t]={i:t,l:!1,exports:{}};return n[t].call(e.exports,e,e.exports,r),e.l=!0,e.exports}return r.m=n,r.c=o,r.d=function(t,e,n){r.o(t,e)||Object.defineProperty(t,e,{enumerable:!0,get:n})},r.r=function(t){"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(t,"__esModule",{value:!0})},r.t=function(e,t){if(1&t&&(e=r(e)),8&t)return e;if(4&t&&"object"==typeof e&&e&&e.__esModule)return e;var n=Object.create(null);if(r.r(n),Object.defineProperty(n,"default",{enumerable:!0,value:e}),2&t&&"string"!=typeof e)for(var o in e)r.d(n,o,function(t){return e[t]}.bind(null,o));return n},r.n=function(t){var e=t&&t.__esModule?function(){return t.default}:function(){return t};return r.d(e,"a",e),e},r.o=function(t,e){return Object.prototype.hasOwnProperty.call(t,e)},r.p="",r(r.s=0)}([function(t,e,n){"use strict";var r="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t},i=function(){function o(t,e){for(var n=0;n<e.length;n++){var o=e[n];o.enumerable=o.enumerable||!1,o.configurable=!0,"value"in o&&(o.writable=!0),Object.defineProperty(t,o.key,o)}}return function(t,e,n){return e&&o(t.prototype,e),n&&o(t,n),t}}(),a=o(n(1)),c=o(n(3)),u=o(n(4));function o(t){return t&&t.__esModule?t:{default:t}}var l=function(t){function o(t,e){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,o);var n=function(t,e){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!e||"object"!=typeof e&&"function"!=typeof e?t:e}(this,(o.__proto__||Object.getPrototypeOf(o)).call(this));return n.resolveOptions(e),n.listenClick(t),n}return function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function, not "+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}(o,c.default),i(o,[{key:"resolveOptions",value:function(){var t=0<arguments.length&&void 0!==arguments[0]?arguments[0]:{};this.action="function"==typeof t.action?t.action:this.defaultAction,this.target="function"==typeof t.target?t.target:this.defaultTarget,this.text="function"==typeof t.text?t.text:this.defaultText,this.container="object"===r(t.container)?t.container:document.body}},{key:"listenClick",value:function(t){var e=this;this.listener=(0,u.default)(t,"click",function(t){return e.onClick(t)})}},{key:"onClick",value:function(t){var e=t.delegateTarget||t.currentTarget;this.clipboardAction&&(this.clipboardAction=null),this.clipboardAction=new a.default({action:this.action(e),target:this.target(e),text:this.text(e),container:this.container,trigger:e,emitter:this})}},{key:"defaultAction",value:function(t){return s("action",t)}},{key:"defaultTarget",value:function(t){var e=s("target",t);if(e)return document.querySelector(e)}},{key:"defaultText",value:function(t){return s("text",t)}},{key:"destroy",value:function(){this.listener.destroy(),this.clipboardAction&&(this.clipboardAction.destroy(),this.clipboardAction=null)}}],[{key:"isSupported",value:function(){var t=0<arguments.length&&void 0!==arguments[0]?arguments[0]:["copy","cut"],e="string"==typeof t?[t]:t,n=!!document.queryCommandSupported;return e.forEach(function(t){n=n&&!!document.queryCommandSupported(t)}),n}}]),o}();function s(t,e){var n="data-clipboard-"+t;if(e.hasAttribute(n))return e.getAttribute(n)}t.exports=l},function(t,e,n){"use strict";var o,r="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t},i=function(){function o(t,e){for(var n=0;n<e.length;n++){var o=e[n];o.enumerable=o.enumerable||!1,o.configurable=!0,"value"in o&&(o.writable=!0),Object.defineProperty(t,o.key,o)}}return function(t,e,n){return e&&o(t.prototype,e),n&&o(t,n),t}}(),a=n(2),c=(o=a)&&o.__esModule?o:{default:o};var u=function(){function e(t){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,e),this.resolveOptions(t),this.initSelection()}return i(e,[{key:"resolveOptions",value:function(){var t=0<arguments.length&&void 0!==arguments[0]?arguments[0]:{};this.action=t.action,this.container=t.container,this.emitter=t.emitter,this.target=t.target,this.text=t.text,this.trigger=t.trigger,this.selectedText=""}},{key:"initSelection",value:function(){this.text?this.selectFake():this.target&&this.selectTarget()}},{key:"selectFake",value:function(){var t=this,e="rtl"==document.documentElement.getAttribute("dir");this.removeFake(),this.fakeHandlerCallback=function(){return t.removeFake()},this.fakeHandler=this.container.addEventListener("click",this.fakeHandlerCallback)||!0,this.fakeElem=document.createElement("textarea"),this.fakeElem.style.fontSize="12pt",this.fakeElem.style.border="0",this.fakeElem.style.padding="0",this.fakeElem.style.margin="0",this.fakeElem.style.position="absolute",this.fakeElem.style[e?"right":"left"]="-9999px";var n=window.pageYOffset||document.documentElement.scrollTop;this.fakeElem.style.top=n+"px",this.fakeElem.setAttribute("readonly",""),this.fakeElem.value=this.text,this.container.appendChild(this.fakeElem),this.selectedText=(0,c.default)(this.fakeElem),this.copyText()}},{key:"removeFake",value:function(){this.fakeHandler&&(this.container.removeEventListener("click",this.fakeHandlerCallback),this.fakeHandler=null,this.fakeHandlerCallback=null),this.fakeElem&&(this.container.removeChild(this.fakeElem),this.fakeElem=null)}},{key:"selectTarget",value:function(){this.selectedText=(0,c.default)(this.target),this.copyText()}},{key:"copyText",value:function(){var e=void 0;try{e=document.execCommand(this.action)}catch(t){e=!1}this.handleResult(e)}},{key:"handleResult",value:function(t){this.emitter.emit(t?"success":"error",{action:this.action,text:this.selectedText,trigger:this.trigger,clearSelection:this.clearSelection.bind(this)})}},{key:"clearSelection",value:function(){this.trigger&&this.trigger.focus(),window.getSelection().removeAllRanges()}},{key:"destroy",value:function(){this.removeFake()}},{key:"action",set:function(){var t=0<arguments.length&&void 0!==arguments[0]?arguments[0]:"copy";if(this._action=t,"copy"!==this._action&&"cut"!==this._action)throw new Error('Invalid "action" value, use either "copy" or "cut"')},get:function(){return this._action}},{key:"target",set:function(t){if(void 0!==t){if(!t||"object"!==(void 0===t?"undefined":r(t))||1!==t.nodeType)throw new Error('Invalid "target" value, use a valid Element');if("copy"===this.action&&t.hasAttribute("disabled"))throw new Error('Invalid "target" attribute. Please use "readonly" instead of "disabled" attribute');if("cut"===this.action&&(t.hasAttribute("readonly")||t.hasAttribute("disabled")))throw new Error('Invalid "target" attribute. You can\'t cut text from elements with "readonly" or "disabled" attributes');this._target=t}},get:function(){return this._target}}]),e}();t.exports=u},function(t,e){t.exports=function(t){var e;if("SELECT"===t.nodeName)t.focus(),e=t.value;else if("INPUT"===t.nodeName||"TEXTAREA"===t.nodeName){var n=t.hasAttribute("readonly");n||t.setAttribute("readonly",""),t.select(),t.setSelectionRange(0,t.value.length),n||t.removeAttribute("readonly"),e=t.value}else{t.hasAttribute("contenteditable")&&t.focus();var o=window.getSelection(),r=document.createRange();r.selectNodeContents(t),o.removeAllRanges(),o.addRange(r),e=o.toString()}return e}},function(t,e){function n(){}n.prototype={on:function(t,e,n){var o=this.e||(this.e={});return(o[t]||(o[t]=[])).push({fn:e,ctx:n}),this},once:function(t,e,n){var o=this;function r(){o.off(t,r),e.apply(n,arguments)}return r._=e,this.on(t,r,n)},emit:function(t){for(var e=[].slice.call(arguments,1),n=((this.e||(this.e={}))[t]||[]).slice(),o=0,r=n.length;o<r;o++)n[o].fn.apply(n[o].ctx,e);return this},off:function(t,e){var n=this.e||(this.e={}),o=n[t],r=[];if(o&&e)for(var i=0,a=o.length;i<a;i++)o[i].fn!==e&&o[i].fn._!==e&&r.push(o[i]);return r.length?n[t]=r:delete n[t],this}},t.exports=n},function(t,e,n){var d=n(5),h=n(6);t.exports=function(t,e,n){if(!t&&!e&&!n)throw new Error("Missing required arguments");if(!d.string(e))throw new TypeError("Second argument must be a String");if(!d.fn(n))throw new TypeError("Third argument must be a Function");if(d.node(t))return s=e,f=n,(l=t).addEventListener(s,f),{destroy:function(){l.removeEventListener(s,f)}};if(d.nodeList(t))return a=t,c=e,u=n,Array.prototype.forEach.call(a,function(t){t.addEventListener(c,u)}),{destroy:function(){Array.prototype.forEach.call(a,function(t){t.removeEventListener(c,u)})}};if(d.string(t))return o=t,r=e,i=n,h(document.body,o,r,i);throw new TypeError("First argument must be a String, HTMLElement, HTMLCollection, or NodeList");var o,r,i,a,c,u,l,s,f}},function(t,n){n.node=function(t){return void 0!==t&&t instanceof HTMLElement&&1===t.nodeType},n.nodeList=function(t){var e=Object.prototype.toString.call(t);return void 0!==t&&("[object NodeList]"===e||"[object HTMLCollection]"===e)&&"length"in t&&(0===t.length||n.node(t[0]))},n.string=function(t){return"string"==typeof t||t instanceof String},n.fn=function(t){return"[object Function]"===Object.prototype.toString.call(t)}},function(t,e,n){var a=n(7);function i(t,e,n,o,r){var i=function(e,n,t,o){return function(t){t.delegateTarget=a(t.target,n),t.delegateTarget&&o.call(e,t)}}.apply(this,arguments);return t.addEventListener(n,i,r),{destroy:function(){t.removeEventListener(n,i,r)}}}t.exports=function(t,e,n,o,r){return"function"==typeof t.addEventListener?i.apply(null,arguments):"function"==typeof n?i.bind(null,document).apply(null,arguments):("string"==typeof t&&(t=document.querySelectorAll(t)),Array.prototype.map.call(t,function(t){return i(t,e,n,o,r)}))}},function(t,e){if("undefined"!=typeof Element&&!Element.prototype.matches){var n=Element.prototype;n.matches=n.matchesSelector||n.mozMatchesSelector||n.msMatchesSelector||n.oMatchesSelector||n.webkitMatchesSelector}t.exports=function(t,e){for(;t&&9!==t.nodeType;){if("function"==typeof t.matches&&t.matches(e))return t;t=t.parentNode}}}])});
8 | 


--------------------------------------------------------------------------------
/analysis/libs/gitbook-2.6.7/js/clipboard.min.js:
--------------------------------------------------------------------------------
1 | /*!
2 |  * clipboard.js v2.0.4
3 |  * https://zenorocha.github.io/clipboard.js
4 |  *
5 |  * Licensed MIT © Zeno Rocha
6 |  */
7 | !function(t,e){"object"==typeof exports&&"object"==typeof module?module.exports=e():"function"==typeof define&&define.amd?define([],e):"object"==typeof exports?exports.ClipboardJS=e():t.ClipboardJS=e()}(this,function(){return function(n){var o={};function r(t){if(o[t])return o[t].exports;var e=o[t]={i:t,l:!1,exports:{}};return n[t].call(e.exports,e,e.exports,r),e.l=!0,e.exports}return r.m=n,r.c=o,r.d=function(t,e,n){r.o(t,e)||Object.defineProperty(t,e,{enumerable:!0,get:n})},r.r=function(t){"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(t,"__esModule",{value:!0})},r.t=function(e,t){if(1&t&&(e=r(e)),8&t)return e;if(4&t&&"object"==typeof e&&e&&e.__esModule)return e;var n=Object.create(null);if(r.r(n),Object.defineProperty(n,"default",{enumerable:!0,value:e}),2&t&&"string"!=typeof e)for(var o in e)r.d(n,o,function(t){return e[t]}.bind(null,o));return n},r.n=function(t){var e=t&&t.__esModule?function(){return t.default}:function(){return t};return r.d(e,"a",e),e},r.o=function(t,e){return Object.prototype.hasOwnProperty.call(t,e)},r.p="",r(r.s=0)}([function(t,e,n){"use strict";var r="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t},i=function(){function o(t,e){for(var n=0;n<e.length;n++){var o=e[n];o.enumerable=o.enumerable||!1,o.configurable=!0,"value"in o&&(o.writable=!0),Object.defineProperty(t,o.key,o)}}return function(t,e,n){return e&&o(t.prototype,e),n&&o(t,n),t}}(),a=o(n(1)),c=o(n(3)),u=o(n(4));function o(t){return t&&t.__esModule?t:{default:t}}var l=function(t){function o(t,e){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,o);var n=function(t,e){if(!t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return!e||"object"!=typeof e&&"function"!=typeof e?t:e}(this,(o.__proto__||Object.getPrototypeOf(o)).call(this));return n.resolveOptions(e),n.listenClick(t),n}return function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function, not "+typeof e);t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}),e&&(Object.setPrototypeOf?Object.setPrototypeOf(t,e):t.__proto__=e)}(o,c.default),i(o,[{key:"resolveOptions",value:function(){var t=0<arguments.length&&void 0!==arguments[0]?arguments[0]:{};this.action="function"==typeof t.action?t.action:this.defaultAction,this.target="function"==typeof t.target?t.target:this.defaultTarget,this.text="function"==typeof t.text?t.text:this.defaultText,this.container="object"===r(t.container)?t.container:document.body}},{key:"listenClick",value:function(t){var e=this;this.listener=(0,u.default)(t,"click",function(t){return e.onClick(t)})}},{key:"onClick",value:function(t){var e=t.delegateTarget||t.currentTarget;this.clipboardAction&&(this.clipboardAction=null),this.clipboardAction=new a.default({action:this.action(e),target:this.target(e),text:this.text(e),container:this.container,trigger:e,emitter:this})}},{key:"defaultAction",value:function(t){return s("action",t)}},{key:"defaultTarget",value:function(t){var e=s("target",t);if(e)return document.querySelector(e)}},{key:"defaultText",value:function(t){return s("text",t)}},{key:"destroy",value:function(){this.listener.destroy(),this.clipboardAction&&(this.clipboardAction.destroy(),this.clipboardAction=null)}}],[{key:"isSupported",value:function(){var t=0<arguments.length&&void 0!==arguments[0]?arguments[0]:["copy","cut"],e="string"==typeof t?[t]:t,n=!!document.queryCommandSupported;return e.forEach(function(t){n=n&&!!document.queryCommandSupported(t)}),n}}]),o}();function s(t,e){var n="data-clipboard-"+t;if(e.hasAttribute(n))return e.getAttribute(n)}t.exports=l},function(t,e,n){"use strict";var o,r="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t},i=function(){function o(t,e){for(var n=0;n<e.length;n++){var o=e[n];o.enumerable=o.enumerable||!1,o.configurable=!0,"value"in o&&(o.writable=!0),Object.defineProperty(t,o.key,o)}}return function(t,e,n){return e&&o(t.prototype,e),n&&o(t,n),t}}(),a=n(2),c=(o=a)&&o.__esModule?o:{default:o};var u=function(){function e(t){!function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,e),this.resolveOptions(t),this.initSelection()}return i(e,[{key:"resolveOptions",value:function(){var t=0<arguments.length&&void 0!==arguments[0]?arguments[0]:{};this.action=t.action,this.container=t.container,this.emitter=t.emitter,this.target=t.target,this.text=t.text,this.trigger=t.trigger,this.selectedText=""}},{key:"initSelection",value:function(){this.text?this.selectFake():this.target&&this.selectTarget()}},{key:"selectFake",value:function(){var t=this,e="rtl"==document.documentElement.getAttribute("dir");this.removeFake(),this.fakeHandlerCallback=function(){return t.removeFake()},this.fakeHandler=this.container.addEventListener("click",this.fakeHandlerCallback)||!0,this.fakeElem=document.createElement("textarea"),this.fakeElem.style.fontSize="12pt",this.fakeElem.style.border="0",this.fakeElem.style.padding="0",this.fakeElem.style.margin="0",this.fakeElem.style.position="absolute",this.fakeElem.style[e?"right":"left"]="-9999px";var n=window.pageYOffset||document.documentElement.scrollTop;this.fakeElem.style.top=n+"px",this.fakeElem.setAttribute("readonly",""),this.fakeElem.value=this.text,this.container.appendChild(this.fakeElem),this.selectedText=(0,c.default)(this.fakeElem),this.copyText()}},{key:"removeFake",value:function(){this.fakeHandler&&(this.container.removeEventListener("click",this.fakeHandlerCallback),this.fakeHandler=null,this.fakeHandlerCallback=null),this.fakeElem&&(this.container.removeChild(this.fakeElem),this.fakeElem=null)}},{key:"selectTarget",value:function(){this.selectedText=(0,c.default)(this.target),this.copyText()}},{key:"copyText",value:function(){var e=void 0;try{e=document.execCommand(this.action)}catch(t){e=!1}this.handleResult(e)}},{key:"handleResult",value:function(t){this.emitter.emit(t?"success":"error",{action:this.action,text:this.selectedText,trigger:this.trigger,clearSelection:this.clearSelection.bind(this)})}},{key:"clearSelection",value:function(){this.trigger&&this.trigger.focus(),window.getSelection().removeAllRanges()}},{key:"destroy",value:function(){this.removeFake()}},{key:"action",set:function(){var t=0<arguments.length&&void 0!==arguments[0]?arguments[0]:"copy";if(this._action=t,"copy"!==this._action&&"cut"!==this._action)throw new Error('Invalid "action" value, use either "copy" or "cut"')},get:function(){return this._action}},{key:"target",set:function(t){if(void 0!==t){if(!t||"object"!==(void 0===t?"undefined":r(t))||1!==t.nodeType)throw new Error('Invalid "target" value, use a valid Element');if("copy"===this.action&&t.hasAttribute("disabled"))throw new Error('Invalid "target" attribute. Please use "readonly" instead of "disabled" attribute');if("cut"===this.action&&(t.hasAttribute("readonly")||t.hasAttribute("disabled")))throw new Error('Invalid "target" attribute. You can\'t cut text from elements with "readonly" or "disabled" attributes');this._target=t}},get:function(){return this._target}}]),e}();t.exports=u},function(t,e){t.exports=function(t){var e;if("SELECT"===t.nodeName)t.focus(),e=t.value;else if("INPUT"===t.nodeName||"TEXTAREA"===t.nodeName){var n=t.hasAttribute("readonly");n||t.setAttribute("readonly",""),t.select(),t.setSelectionRange(0,t.value.length),n||t.removeAttribute("readonly"),e=t.value}else{t.hasAttribute("contenteditable")&&t.focus();var o=window.getSelection(),r=document.createRange();r.selectNodeContents(t),o.removeAllRanges(),o.addRange(r),e=o.toString()}return e}},function(t,e){function n(){}n.prototype={on:function(t,e,n){var o=this.e||(this.e={});return(o[t]||(o[t]=[])).push({fn:e,ctx:n}),this},once:function(t,e,n){var o=this;function r(){o.off(t,r),e.apply(n,arguments)}return r._=e,this.on(t,r,n)},emit:function(t){for(var e=[].slice.call(arguments,1),n=((this.e||(this.e={}))[t]||[]).slice(),o=0,r=n.length;o<r;o++)n[o].fn.apply(n[o].ctx,e);return this},off:function(t,e){var n=this.e||(this.e={}),o=n[t],r=[];if(o&&e)for(var i=0,a=o.length;i<a;i++)o[i].fn!==e&&o[i].fn._!==e&&r.push(o[i]);return r.length?n[t]=r:delete n[t],this}},t.exports=n},function(t,e,n){var d=n(5),h=n(6);t.exports=function(t,e,n){if(!t&&!e&&!n)throw new Error("Missing required arguments");if(!d.string(e))throw new TypeError("Second argument must be a String");if(!d.fn(n))throw new TypeError("Third argument must be a Function");if(d.node(t))return s=e,f=n,(l=t).addEventListener(s,f),{destroy:function(){l.removeEventListener(s,f)}};if(d.nodeList(t))return a=t,c=e,u=n,Array.prototype.forEach.call(a,function(t){t.addEventListener(c,u)}),{destroy:function(){Array.prototype.forEach.call(a,function(t){t.removeEventListener(c,u)})}};if(d.string(t))return o=t,r=e,i=n,h(document.body,o,r,i);throw new TypeError("First argument must be a String, HTMLElement, HTMLCollection, or NodeList");var o,r,i,a,c,u,l,s,f}},function(t,n){n.node=function(t){return void 0!==t&&t instanceof HTMLElement&&1===t.nodeType},n.nodeList=function(t){var e=Object.prototype.toString.call(t);return void 0!==t&&("[object NodeList]"===e||"[object HTMLCollection]"===e)&&"length"in t&&(0===t.length||n.node(t[0]))},n.string=function(t){return"string"==typeof t||t instanceof String},n.fn=function(t){return"[object Function]"===Object.prototype.toString.call(t)}},function(t,e,n){var a=n(7);function i(t,e,n,o,r){var i=function(e,n,t,o){return function(t){t.delegateTarget=a(t.target,n),t.delegateTarget&&o.call(e,t)}}.apply(this,arguments);return t.addEventListener(n,i,r),{destroy:function(){t.removeEventListener(n,i,r)}}}t.exports=function(t,e,n,o,r){return"function"==typeof t.addEventListener?i.apply(null,arguments):"function"==typeof n?i.bind(null,document).apply(null,arguments):("string"==typeof t&&(t=document.querySelectorAll(t)),Array.prototype.map.call(t,function(t){return i(t,e,n,o,r)}))}},function(t,e){if("undefined"!=typeof Element&&!Element.prototype.matches){var n=Element.prototype;n.matches=n.matchesSelector||n.mozMatchesSelector||n.msMatchesSelector||n.oMatchesSelector||n.webkitMatchesSelector}t.exports=function(t,e){for(;t&&9!==t.nodeType;){if("function"==typeof t.matches&&t.matches(e))return t;t=t.parentNode}}}])});
8 | 


--------------------------------------------------------------------------------
/analysis/sort.Rmd:
--------------------------------------------------------------------------------
  1 | ---
  2 | title : 排序专题
  3 | author: 高文欣
  4 | date: "`r Sys.Date()`"
  5 | output: bookdown::gitbook
  6 | bibliography: ../refs/add.bib
  7 | ---
  8 | 
  9 | # 十大经典排序
 10 | 
 11 | ## 快速排序写法一
 12 | 
 13 | 基准大法
 14 | 
 15 | 基准左边的都不大于它，基准右边的都不小于它
 16 | 左右两边一起搜索交换[jianzhu](https://www.jianshu.com/p/55ab254586bf)
 17 | 
 18 | 从左边开始找到一个比它大的数，从右边往左找到一个比它小的数，交换位置
 19 | 
 20 | >冒泡排序的特点是每次都比较相邻的两个数字，每次位置互换，也只能换一个跨度。 快速排序之所比较快，因为相比冒泡排序，每次交换是跳跃式的。每次排序的时候设置一个基准点，将小于等于基准点的数全部放到基准点的左边，将大于等于基准点的数全部放到基准点的右边。这样在每次交换的时候就不会像冒泡排序一样每次只能在相邻的数之间进行交换，交换的距离就大的多了。因此总的比较和交换次数就少了，速度自然就提高了。当然在最坏的情况下，仍可能是相邻的两个数进行了交换。
 21 | 
 22 | ```python
 23 | def quickSort(arr, left=None, right=None):
 24 |     left = 0 if not isinstance(left,(int, float)) else left
 25 |     right = len(arr)-1 if not isinstance(right,(int, float)) else right
 26 |     if left < right:
 27 |         partitionIndex = partition(arr, left, right)
 28 |         quickSort(arr, left, partitionIndex-1)
 29 |         quickSort(arr, partitionIndex+1, right)
 30 |     return arr
 31 | 
 32 | def partition(arr, left, right):
 33 |     pivot = left
 34 |     index = pivot+1
 35 |     i = index
 36 |     while  i <= right:
 37 |         if arr[i] < arr[pivot]:
 38 |             swap(arr, i, index)
 39 |             index+=1
 40 |         i+=1
 41 |     swap(arr,pivot,index-1)#left往右，index往左，就是这里要理解
 42 |     return index-1
 43 | 
 44 | def swap(arr, i, j):
 45 |     arr[i], arr[j] = arr[j], arr[i]
 46 | ```
 47 | 
 48 | ## 快速排序写法二
 49 | 
 50 | - **这个方法更好理解，也简单一些**
 51 | ```r
 52 | def quick_sort(data):    
 53 |     """快速排序"""    
 54 |     if len(data) >= 2:  # 递归入口及出口        
 55 |         mid = data[len(data)//2]  # 选取基准值，也可以选取第一个或最后一个元素        
 56 |         left, right = [], []  # 定义基准值左右两侧的列表        
 57 |         data.remove(mid)  # 从原始数组中移除基准值        
 58 |         for num in data:            
 59 |             if num >= mid:                
 60 |                 right.append(num)            
 61 |             else:                
 62 |                 left.append(num)        
 63 |         return quick_sort(left) + [mid] + quick_sort(right)    
 64 |     else:        
 65 |         return data
 66 | ```
 67 | 
 68 | 快速排序的一次划分算法从两头交替搜索，直到low和high重合，因此其时间复杂度是O(n)；而整个快速排序算法的时间复杂度与划分的趟数有关。
 69 | 理想的情况是，每次划分所选择的中间数恰好将当前序列几乎等分，经过log2n趟划分，便可得到长度为1的子表。这样，整个算法的时间复杂度为O(nlog2n)。
 70 | 最坏的情况是，每次所选的中间数是当前序列中的最大或最小元素，这使得每次划分所得的子表中一个为空表，另一子表的长度为原表的长度-1。这样，长度为n的数据表的快速排序需要经过n趟划分，使得整个排序算法的时间复杂度为O(n2)。 
 71 | 为改善最坏情况下的时间性能，可采用其他方法选取中间数。通常采用“三者值取中”方法，即比较H->r[low].key、H->r[high].key与H->r[(10w+high)/2].key，取三者中关键字为中值的元素为中间数。 
 72 | 可以证明，快速排序的平均时间复杂度也是O(nlog2n)。因此，该排序方法被认为是目前最好的一种内部排序方法。 
 73 | 从空间性能上看，尽管快速排序只需要一个元素的辅助空间，但快速排序需要一个栈空间来实现递归。最好的情况下，即快速排序的每一趟排序都将元素序列均匀地分割成长度相近的两个子表，所需栈的最大深度为log2(n+1)；但最坏的情况下，栈的最大深度为n。这样，快速排序的空间复杂度为O(log2n))
 74 | 
 75 | - isinstance
 76 | 
 77 | >The isinstance() function checks if the object (first argument) is an instance or subclass of classinfo class (second argument).
 78 | 
 79 | 判断第一个参数变量是否是第二个参数的类型
 80 | 
 81 | 
 82 | 
 83 | 
 84 | ## 归并排序
 85 | 
 86 | 分而治之
 87 | 
 88 | ```python
 89 | def mergeSort(arr):
 90 |     import math
 91 |     if(len(arr)<2):
 92 |         return arr
 93 |     middle = math.floor(len(arr)/2)
 94 |     left, right = arr[0:middle], arr[middle:]
 95 |     return merge(mergeSort(left), mergeSort(right))
 96 | 
 97 | def merge(left,right):
 98 |     result = [] #定义一个空列表追加元素
 99 |     while left and right:
100 |         if left[0] <= right[0]:
101 |             result.append(left.pop(0));
102 |         else:
103 |             result.append(right.pop(0));
104 |     while left:
105 |         result.append(left.pop(0));
106 |     while right:
107 |         result.append(right.pop(0));
108 |     return result
109 | ```
110 | 
111 | ## 冒泡排序
112 | 
113 | ```r
114 | def bub(arr):
115 |     for i in range(len(arr)):
116 |         for j in range(i+1,len(arr)):
117 |             if arr[i]>arr[j]:
118 |                 arr[j],arr[i]=arr[i],arr[j]
119 |     return arr
120 | l=bub(arr)
121 | print(l)
122 | ```
123 | 
124 | ## 选择排序
125 | 
126 | 选择排序
127 | 1. 算法步骤
128 | 首先在未排序序列中找到最小（大）元素，存放到排序序列的起始位置
129 | 
130 | 再从剩余未排序元素中继续寻找最小（大）元素，然后放到已排序序列的末尾。
131 | 
132 | 重复第二步，直到所有元素均排序完毕
133 | 
134 | ```r
135 | 
136 | 
137 | 
138 | def select(arr):
139 |     for i in range(len(arr)-1):
140 |         minidx=i #当前是最小的索引
141 |         for j in range(i+1,len(arr)):
142 |             if arr[minidx]>arr[j]:
143 |                 minidx=j
144 |         if i!=minidx: #当i不是最小值的时候和最小值交换
145 |             arr[i],arr[minidx]=arr[minidx],arr[i]
146 |     return arr
147 | 
148 | print(select(arr))
149 | ```
150 | 
151 | ## 插入排序
152 | 
153 | 插入排序
154 | 
155 | 将第一待排序序列第一个元素看做一个有序序列，把第二个元素到最后一个元素当成是未排序序列。
156 | 
157 | 从头到尾依次扫描未排序序列，将扫描到的每个元素插入有序序列的适当位置。
158 | （如果待插入的元素与有序序列中的某个元素相等，则将待插入元素插入到相等元素的后面。）
159 | 
160 | 适用场景，小规模数据集或者数据基本有序的时候
161 | 
162 | ```r
163 | 
164 | 
165 | def insertsort(arr):
166 |     for i in range(1,len(arr)):
167 |         pre=i-1
168 |         cur=arr[i]
169 |         while pre>=0:
170 |             if arr[pre]>cur:
171 |                 arr[pre+1]=arr[pre]
172 |                 arr[pre]=cur
173 |             pre-=1
174 |     return arr
175 | 
176 | print(insertsort(arr))
177 | ```
178 | 
179 | 
180 | 
181 | ## 拓扑排序
182 | 
183 | 遍历一个有向无环图
184 | *入度*:指向该顶点的边
185 | *出度*:从该顶点发出的边
186 | 
187 | 最经典的例子:先修课
188 | 
189 | 拓扑排序，维持一个入度为0的队列即可。
190 | 
191 | [拓扑排序](https://mp.weixin.qq.com/s?__biz=MzA3MjU5NjU2NA==&mid=2455502896&idx=1&sn=df6f2c86e0f1de823f79087ba9e8eb33&chksm=88b34d0bbfc4c41d863b4b6d78309e6ae01e766b1a7826b4c326246dd2489df9d684e8091ece&scene=21#wechat_redirect)
192 | 
193 | 
194 | 参考[10大经典排序python实现](https://mp.weixin.qq.com/s/Yp1hD2Bbmj3pRrLYjfwfEw)
195 | 
196 | ## 希尔排序
197 | 
198 | 适用于大规模无序的，因为每个小的分组上，插入排序的效率比较高，因为小规模的插入排序效率比较高，因此把大规模的变成小规模的
199 | 
200 | 时间复杂度$O^{1.3-2}$
201 | 
202 | 步骤
203 | 选择一个增量序列 t1，t2，……，tk，其中 ti > tj, tk = 1；
204 | 
205 | 按增量序列个数 k，对序列进行 k 趟排序；
206 | 
207 | 每趟排序，根据对应的增量 ti，将待排序列分割成若干长度为 m 的子序列，分别对各子表进行直接插入排序。
208 | 仅增量因子为 1 时，整个序列作为一个表来处理，表长度即为整个序列的长度。
209 | 
210 | 不行，还是没有很懂
211 | 
212 | ```r
213 | 
214 | list=[91,9,8,7,6,78,5,4,3,2,1]
215 | 
216 | def shell_sort(list):
217 |     n = len(list)
218 |     # 初始步长
219 |     gap = n // 2 #这里的步长是随机分为gap/2组了，步长
220 |     while gap > 0:
221 |         for i in range(gap, n):
222 |             # 每个步长进行插入排序
223 |             temp = list[i]
224 |             j = i
225 |             # 插入排序
226 |             while j >= gap and list[j - gap] > temp:
227 |                 list[j] = list[j - gap]
228 |                 j -= gap
229 |             list[j] = temp
230 |         # 得到新的步长
231 |         gap = gap // 2
232 |     return list
233 | 
234 | print(shell_sort(list))
235 | ```
236 | 
237 | 参考： https://zhuanlan.zhihu.com/p/21839027
238 | 
239 | 
240 | 
241 | ## 计数排序
242 | 
243 | 计数排序的核心在于将输入的数据值转化为键存储在额外开辟的数组空间中。
244 | 作为一种线性时间复杂度的排序，计数排序要求输入的数据必须是有确定范围的整数。
245 | 
246 | 找出原数组中元素值最大的，记为max。
247 | 
248 | 创建一个新数组count，其长度是max加1，其元素默认值都为0。
249 | 
250 | 遍历原数组中的元素，以原数组中的元素作为count数组的索引，以原数组中的元素出现次数作为count数组的元素值。
251 | 
252 | 创建结果数组result，起始索引index。
253 | 
254 | 遍历count数组，找出其中元素值大于0的元素，将其对应的索引作为元素值填充到result数组中去，每处理一次，count中的该元素值减1，直到该元素值不大于0，依次处理count中剩下的元素。
255 | 
256 | 返回结果数组result。
257 | 
258 | ```r
259 | 
260 | def countingSort(arr, maxValue):
261 |     bucketLen = maxValue+1
262 |     bucket = [0]*bucketLen
263 |     sortedIndex =0
264 |     arrLen = len(arr)
265 |     for i in range(arrLen):
266 |         if not bucket[arr[i]]:
267 |             bucket[arr[i]]=0
268 |         bucket[arr[i]]+=1
269 |     for j in range(bucketLen):
270 |         while bucket[j]>0:
271 |             arr[sortedIndex] = j
272 |             sortedIndex+=1
273 |             bucket[j]-=1
274 |     return arr
275 | ```
276 | ## 桶排序
277 | 
278 | 桶排序是
279 | 计数排序的升级版。它利用了函数的映射关系，高效与否的关键就在于这个映射函数的确定。为了使桶排序更加高效，我们需要做到这两点：
280 | 
281 | 在额外空间充足的情况下，尽量增大桶的数量
282 | 使用的映射函数能够将输入的 N 个数据均匀的分配到 K 个桶中
283 | 同时，对于桶中元素的排序，选择何种比较排序算法对于性能的影响至关重要。
284 | 
285 | 1. 什么时候最快
286 | 当输入的数据可以均匀的分配到每一个桶中。
287 | 
288 | 2. 什么时候最慢
289 | 当输入的数据被分配到了同一个桶中。
290 | 
291 | 
292 | ```r
293 | def Bucket_Sort(array, bucketsize):
294 |     minValue = min(array)
295 |     maxValue = max(array)
296 |     res = []
297 |     bucketcount = (maxValue - minValue + 1) // bucketsize
298 |     bucket_lists = [[] for i in range(bucketcount)]
299 | 
300 |     for i in array:
301 |         bucket_index = (i - minValue) // bucketsize
302 |         bucket_lists[bucket_index].append(i)
303 |     # 桶内排序
304 |     for j in bucket_lists:
305 |         Quick_Sort_2(j, 0, len(j) - 1)
306 | 
307 |     for j in bucket_lists:
308 |         if len(j) != 0:
309 |             res.extend(j)
310 |     return res
311 | ```
312 | 
313 | 
314 | ## 基数排序
315 | 基数排序是一种非比较型整数排序算法，其原理是将整数按位数切割成不同的数字，然后按每个位数分别比较
316 | 。由于整数也可以表达字符串（比如名字或日期）和特定格式的浮点数，所以基数排序也不是只能使用于整数。
317 | 
318 | 
319 | 基数排序有两种方法：
320 | 
321 | 这三种排序算法都利用了桶的概念，但对桶的使用方法上有明显差异案例看大家发的：
322 | 
323 | 基数排序：根据键值的每位数字来分配桶；
324 | 计数排序：每个桶只存储单一键值；
325 | 桶排序：每个桶存储一定范围的数值；
326 | 
327 | ```r
328 | 
329 | def radix_sort(s):
330 |     """基数排序"""
331 |     i = 0 # 记录当前正在排拿一位，最低位为1
332 |     max_num = max(s)  # 最大值
333 |     j = len(str(max_num))  # 记录最大值的位数
334 |     while i < j:
335 |         bucket_list =[[] for _ in range(10)] #初始化桶数组
336 |         for x in s:
337 |             bucket_list[int(x / (10**i)) % 10].append(x) # 找到位置放入桶数组
338 |         print(bucket_list)
339 |         s.clear()
340 |         for x in bucket_list:   # 放回原序列
341 |             for y in x:
342 |                 s.append(y)
343 |         i += 1
344 | `
345 | 
346 | ```
347 | 
348 | ## 堆排序
349 | 
350 | 堆排序（Heapsort）是指利用堆这种数据结构所设计的一种排序算法。堆积是一个近似完全二叉树的结构，并同时满足堆积的性质：即子结点的键值或索引总是小于（或者大于）它的父节点。堆排序可以说是一种利用堆的概念来排序的选择排序。分为两种方法：
351 | 
352 | 大顶堆：每个节点的值都大于或等于其子节点的值，在堆排序算法中用于升序排列；
353 | 小顶堆：每个节点的值都小于或等于其子节点的值，在堆排序算法中用于降序排列；
354 | 堆排序的平均时间复杂度为 Ο(nlogn)。
355 | 
356 | 算法步骤
357 | 将待排序序列构建成一个堆 H[0……n-1]，根据（升序降序需求）选择大顶堆或小顶堆；
358 | 
359 | 把堆首（最大值）和堆尾互换；
360 | 
361 | 把堆的尺寸缩小 1，并调用 shift_down(0)，目的是把新的数组顶端数据调整到相应位置；
362 | 
363 | 重复步骤 2，直到堆的尺寸为 1。
364 | 
365 | ```r
366 | def buildMaxHeap(arr):
367 |     import math
368 |     for i in range(math.floor(len(arr)/2),-1,-1):
369 |         heapify(arr,i)
370 | 
371 | def heapify(arr, i):
372 |     left = 2*i+1
373 |     right = 2*i+2
374 |     largest = i
375 |     if left < arrLen and arr[left] > arr[largest]:
376 |         largest = left
377 |     if right < arrLen and arr[right] > arr[largest]:
378 |         largest = right
379 | 
380 |     if largest != i:
381 |         swap(arr, i, largest)
382 |         heapify(arr, largest)
383 | 
384 | def swap(arr, i, j):
385 |     arr[i], arr[j] = arr[j], arr[i]
386 | 
387 | def heapSort(arr):
388 |     global arrLen
389 |     arrLen = len(arr)
390 |     buildMaxHeap(arr)
391 |     for i in range(len(arr)-1,0,-1):
392 |         swap(arr,0,i)
393 |         arrLen -=1
394 |         heapify(arr, 0)
395 |     return arr
396 | 
397 | ```
398 | ## 二分查找
399 | 
400 | ```r
401 | 
402 | def binary_search(lis, left, right, num):
403 | 
404 |         if left > right: #递归结束条件
405 |             return -1
406 |         mid = (left + right) // 2
407 |         if num < lis[mid]:
408 |             right = mid -1
409 |         elif num > lis[mid]:
410 |             left = mid + 1
411 |         else:
412 |             return mid
413 |         return binary_search(lis, left, right, num)
414 |         #这里之所以会有return是因为必须要接收值，不然返回None
415 |         #回溯到最后一层的时候，如果没有return，那么将会返回None
416 | ```
417 | ## 排序算法时间复杂度分析
418 | 
419 | 稳定：如果a原本在b前面，而a=b，排序之后a仍然在b的前面。
420 | 不稳定：如果a原本在b的前面，而a=b，排序之后 a 可能会出现在 b 的后面。
421 | 时间复杂度：对排序数据的总的操作次数。反映当n变化时，操作次数呈现什么规律。
422 | 空间复杂度：是指算法在计算机
423 | 
424 | ![时间复杂度与空间复杂度](../figs/时间复杂度与空间复杂度.jpg)
425 | 
426 | ## 实现sqrt
427 | 
428 | 问题可以等效与求解 $f(x)=x^2-n u m$ 的零点
429 | 泰勒一阶展开: $f(x)=f\left(x_0\right)+f^{\prime}\left(x_0\right)\left(x-x_0\right)$
430 | 
431 | 令 $\mathrm{f}(\mathrm{x})=0$,有 $x=x_0-f\left(x_0\right) / f^{\prime}\left(x_0\right)$
432 | 
433 | 对于 $\mathrm{f}(\mathrm{x})$ ，导数为 $2 \mathrm{x}$ ，求得: $x=\frac{1}{2}\left(x_0+\frac{n}{x_0}\right)$
434 | 
435 | 每次按照上面的公式更新x即可
436 | 
437 | 解题思路：牛顿法
438 | 
439 | ```r
440 | def sqrt_newton(num, p):
441 |     """
442 |     num为待开方数字
443 |     p为给定的精度，例如1e-5
444 |     """
445 |     if num == 0:
446 |         return 0
447 |     x = num / 2
448 |     while abs(x ** 2 - num) > p:
449 |         x = (x + num / x) / 2
450 |     return x
451 |  
452 | num = 0.16
453 | p = 1e-5
454 | print(sqrt_newton(num, p))
455 | 
456 | ```
457 | 


--------------------------------------------------------------------------------
/analysis/string.Rmd:
--------------------------------------------------------------------------------
  1 | ---
  2 | title : 字符串专题
  3 | author: 高文欣
  4 | date: "`r Sys.Date()`"
  5 | output: bookdown::gitbook
  6 | bibliography: ../refs/add.bib
  7 | ---
  8 | 
  9 | # 字符串专题
 10 | 
 11 | ## 反转字符串一
 12 | 
 13 | - 题目描述
 14 | 
 15 | 编写一个函数，其作用是将输入的字符串反转过来。输入字符串以字符数组 char[] 的形式给出。
 16 | 
 17 | 不要给另外的数组分配额外的空间，你必须原地修改输入数组、使用 O(1) 的额外空间解决这一问题。
 18 | 
 19 | 你可以假设数组中的所有字符都是 ASCII 码表中的可打印字符。
 20 | 
 21 | 示例 1：
 22 | 输入：["h","e","l","l","o"]
 23 | 输出：["o","l","l","e","h"]
 24 | 
 25 | 示例 2：
 26 | 输入：["H","a","n","n","a","h"]
 27 | 输出：["h","a","n","n","a","H"]
 28 | 
 29 | - 解题思路
 30 | 
 31 | 其实一个库函数就能完成的reverse or [::-1]，但是不能这样
 32 | 
 33 | ```r
 34 | class Solution:
 35 |     def reverseString(self, s: List[str]) -> None:
 36 |         """
 37 |         Do not return anything, modify s in-place instead.
 38 |         """
 39 |         left, right = 0, len(s) - 1
 40 |         while(left < right):
 41 |             s[left], s[right] = s[right], s[left]
 42 |             left += 1
 43 |             right -= 1
 44 |         return s
 45 | ```
 46 | 
 47 | ## 反转字符串二
 48 | 
 49 | - 题目描述
 50 | 
 51 | 给定一个字符串 s 和一个整数 k，你需要对从字符串开头算起的**每隔 2k 个字符的前 k 个字符进行反转。**
 52 | 
 53 | 如果剩余字符少于 k 个，则将剩余字符全部反转。
 54 | 
 55 | 如果剩余字符小于 2k 但大于或等于 k 个，则反转前 k 个字符，其余字符保持原样。
 56 | 
 57 | 示例:
 58 | 
 59 | 输入: s = "abcdefg", k = 2
 60 | 输出: "bacdfeg"
 61 | 
 62 | - 解题思路
 63 | 
 64 | 每隔2k个字符反转，某年天眼查的面试题，根基还是反转字符串
 65 | 
 66 | ```r
 67 | 
 68 | class Solution(object):
 69 |     def reverseStr(self, s, k):
 70 |         from functools import reduce
 71 |         s = list(s) # 先把字符串变成list
 72 |         # a另一种方法 a[::-1]
 73 |         def reverse(s): # 这个就是反转字符串
 74 |             left, right = 0, len(s) - 1
 75 |             while left < right:
 76 |                 s[left], s[right] = s[right], s[left]
 77 |                 left += 1
 78 |                 right -= 1
 79 |             return s
 80 |         
 81 |         # make sure we reverse each 2k elements 
 82 |         for i in range(0, len(s), 2*k): # 选择条件是每隔2k个
 83 |             s[i:(i+k)] = reverse(s[i:(i+k)]) # 递归
 84 |         
 85 |         # combine list into str.
 86 |         return reduce(lambda a, b: a+b, s) # 最后拼成字符串
 87 | 
 88 | ```
 89 | 
 90 | 
 91 | ## 无重复字符的最长子串
 92 | 
 93 | 给定一个字符串，请你找出其中不含有重复字符的最长子串的长度。
 94 | 
 95 | 示例1:
 96 | 
 97 | 输入: "abcabcbb"
 98 | 输出: 3 
 99 | 解释: 因为无重复字符的最长子串是 "abc"，所以其长度为 3。
100 | 示例 2:
101 | 
102 | 输入: "bbbbb"
103 | 输出: 1
104 | 解释: 因为无重复字符的最长子串是 "b"，所以其长度为 1。
105 | 示例 3:
106 | 
107 | 输入: "pwwkew"
108 | 输出: 3
109 | 解释: 因为无重复字符的最长子串是"wke"，所以其长度为 3。
110 | 请注意，你的答案必须是子串的长度，"pwke"是一个子序列，不是子串。
111 | 
112 | **分析**：切割大法好
113 | 
114 | ```r
115 | class Solution:
116 |     def lengthOfLongestSubstring(self, s: str) -> int:
117 |         L = [] # 定义一个空的列表用来存字串
118 |         lenth = 0
119 |         for i in s:
120 |             #如果字符不在列表中，追加该字符并计算列表长度
121 |             if i not in L:
122 |                 L.append(i)
123 |             #如果字符在列表中，从字符所在位置切分列表
124 |             else:
125 |                 idx = L.index(i) # 获得索引的一种方式
126 |                 L = L[idx+1:]
127 |                 L.append(i)#切分之后将字符追加入列表
128 |             current = len(L)
129 |             lenth = max(current,lenth)
130 |         return lenth
131 | ```
132 | 
133 | ## 替换空格
134 | 
135 | - 题目描述
136 | 
137 | 请实现一个函数，把字符串 s 中的每个空格替换成"%20"。
138 | 
139 | 示例 1： 输入：s = "We are happy."
140 | 输出："We%20are%20happy."
141 | 
142 | - 解题思路
143 | 
144 | 其实一个replace就能搞定，但是不能这么干
145 | 
146 | ```r
147 | # -*- coding:utf-8 -*-
148 | class Solution:
149 |     # s 源字符串
150 |     def replaceSpace(self, s):
151 |         # write code here
152 |         s = list(s)
153 |         for i in range(len(s)):
154 |             if s[i] == ' ':
155 |                 s[i] = '%20'
156 |         return ''.join(s)
157 | ```
158 | 
159 | ## 反转字符串里面的单词
160 | 
161 | - 题目描述
162 | 给定一个字符串，逐个翻转字符串中的每个单词。
163 | 
164 | 示例 1：
165 | 输入: "the sky is blue"
166 | 输出: "blue is sky the"
167 | 
168 | 示例 2：
169 | 输入: "  hello world!  "
170 | 输出: "world! hello"
171 | 解释: 输入字符串可以在前面或者后面包含多余的空格，但是反转后的字符不能包括。
172 | 
173 | 示例 3：
174 | 输入: "a good   example"
175 | 输出: "example good a"
176 | 解释: 如果两个单词间有多余的空格，将反转后单词间的空格减少到只含一个。
177 | 
178 | 只是交换单词的顺序，但是单词还是原来的单词
179 | 
180 | - 解题思路
181 | 
182 | ```r
183 | class Solution:
184 |     def reverseWords(self, s: str) -> str:
185 |         return " ".join(s.strip().split()[::-1])   
186 | ```
187 | 
188 | ## 左旋字符串
189 | 
190 | - 题目描述
191 | 
192 | 字符串的左旋转操作是把字符串前面的若干个字符转移到字符串的尾部。请定义一个函数实现字符串左旋转操作的功能。比如，输入字符串"abcdefg"和数字2，该函数将返回左旋转两位得到的结果"cdefgab"。
193 | 
194 | 示例 1：
195 | 输入: s = "abcdefg", k = 2
196 | 输出: "cdefgab"
197 | 
198 | 示例 2：
199 | 输入: s = "lrloseumgh", k = 6
200 | 输出: "umghlrlose"
201 | 
202 | 限制：
203 | 1 <= k < s.length <= 10000
204 | 
205 | 限制条件，不额外开辟空间
206 | 
207 | - 解题思路
208 | 
209 | ```r
210 | class Solution:
211 |     def reverseLeftWords(self, s: str, n: int) -> str:
212 |         return s[n:] + s[0:n]
213 |     
214 | ```
215 | 
216 | ## 最小覆盖字串
217 | 
218 | - 题目描述
219 | 给你一个字符串 s 、一个字符串 t 。返回 s 中涵盖 t 所有字符的最小子串。如果 s 中不存在涵盖 t 所有字符的子串，则返回空字符串 "" 。
220 | 
221 | 示例 1：
222 | 输入：s = "ADOBECODEBANC", t = "ABC"
223 | 输出："BANC"
224 | 
225 | 示例 2：
226 | 输入：s = "a", t = "a"
227 | 输出："a"
228 | 
229 | 示例 3:
230 | 输入: s = "a", t = "aa"
231 | 输出: ""
232 | 解释: t 中两个字符 'a' 均应包含在 s 的子串中，
233 | 因此没有符合条件的子字符串，返回空字符串。
234 | 
235 | - 解题思路
236 | 
237 | 滑动窗口
238 | 
239 | ```r
240 | class Solution:
241 |     def minWindow(self, s: str, t: str) -> str:
242 |         need = collections.defaultdict(int) # 记录t中字符出现次数
243 |         window = collections.defaultdict(int) # 记录窗口中响应的字符出现的次数
244 |         for c in t:
245 |             need[c] += 1
246 |         
247 |         left,right = 0,0 # 初始窗口长度为0
248 |         valid = 0 # 用于记录window中t中字符是否出现完，比如：t='abc'，window='abd',valid就等于2.代表need中应该出现的字符在window中才出现了两个，还没有出现完全
249 | 
250 |         # 记录最小覆盖子串的起始索引及长度
251 |         start = 0
252 |         length = len(s) + 1
253 | 
254 |         while right < len(s):
255 |             c = s[right] # 即将加入window的字符c
256 |             right += 1 # 右移窗口
257 | 
258 |             # 窗口内数据的一系列更新
259 |             if c in need:
260 |                 window[c] += 1
261 |                 if window[c] == need[c]: # window中字符c出现的次数已经达到need所需要的次数时，valid进行更新
262 |                     valid += 1
263 | 
264 |             # 判断窗口左侧边界是否要收缩
265 |             while valid == len(need):
266 |                 # 在这里更新最小覆盖子串
267 |                 if right-left < length:
268 |                     start = left
269 |                     length = right-left
270 | 
271 |                 # d是将移出窗口的字符
272 |                 d = s[left]
273 |                 # 左移窗口
274 |                 left += 1
275 |                 # 进行窗口内数据的一系列更新
276 |                 if d in need:
277 |                     if window[d] == need[d]: # 这句话和下面的window[c]-=1不能反，先判断删去的字符c的数量是不是满足need的数量，如果满足，valid将减去1。
278 |                         valid -= 1
279 |                     window[d] -= 1
280 |         # 返回最小覆盖子串
281 |         if length == len(s) + 1:
282 |             return ''
283 |         else:
284 |             return s[start:start+length]
285 | 
286 | ```
287 | 
288 | 
289 | ## 字符串转换整数
290 | 
291 | - 题目描述
292 | 
293 | 将字符串转化成为整数
294 | 
295 | 例子
296 | s="1234"
297 | 转化后：ss=[1,2,3,4]
298 | 
299 | 使用正则表达式：
300 | 
301 | 
302 | ```r
303 | 
304 | ^ 匹配字符串开头
305 | 
306 | [\+\-] 代表一个+字符或-字符
307 | 
308 | ? 前面一个字符可有可无
309 | 
310 | \d 一个数字
311 | 
312 | + 前面一个字符的一个或多个
313 | 
314 | \D 一个非数字字符
315 | 
316 | * 前面一个字符的0个或多个
317 | 
318 | max(min(数字, 2**31 - 1), -2**31) 用来防止结果越界
319 | 
320 | ```
321 | 
322 | 为什么可以使用正则表达式？如果整数过大溢出怎么办？
323 | 
324 | 题目中描述： 假设我们的环境只能存储 32 位大小的有符号整数
325 | 
326 | 首先，这个假设对于 Python 不成立，Python 不存在 32 位的 int 类型。其次，即使搜索到的字符串转32位整数可能导致溢出，我们也可以直接通过字符串判断是否存在溢出的情况（比如 try 函数 或 判断字符串长度 + 字符串比较），
327 | 
328 | 
329 | ```r
330 | class Solution:
331 |     def myAtoi(self, s: str) -> int:
332 |         return max(min(int(*re.findall('^[\+\-]?\d+', s.lstrip())), 2**31 - 1), -2**31)
333 | 
334 | ```
335 | 
336 | 正则真的好方便啊啊啊啊~
337 | 
338 | 
339 | ## 最长公共前缀
340 | 
341 | 编写一个函数来查找字符串数组中的最长公共前缀。
342 | 
343 | 如果不存在公共前缀，返回空字符串 ""。
344 | 
345 | 示例 1:
346 | 
347 | 输入: ["flower","flow","flight"]
348 | 输出: "fl"
349 | 示例 2:
350 | 
351 | 输入: ["dog","racecar","car"]
352 | 输出: ""
353 | 解释: 输入不存在公共前缀。
354 | 说明:
355 | 
356 | 所有输入只包含小写字母 a-z 。
357 | - ascii 码思路，字母是可以比较大小的
358 | >利用python的max()和min()，在Python里字符串是可以比较的，按照ascII值排，举例abb， aba，abac，最大为abb，最小为aba。所以只需要比较最大最小的公共前缀就是整个数组的公共前缀
359 | 
360 | ```r
361 | class Solution:
362 |     def longestCommonPrefix(self, strs: List[str]) -> str:
363 |         if not strs: return ""
364 |         s1=min(strs)
365 |         s2=max(strs)
366 |         for k,v in enumerate(s1):
367 |             if v !=s2[k]:
368 |                 return s2[:k]
369 |         return s1
370 | 
371 | ```
372 | 
373 | - 解题思路2
374 | 使用 zip 根据字符串下标合并成数组，
375 | 判断合并后数组里元素是否都相同
376 | 
377 | ```r
378 | class Solution(object):
379 |     def longestCommonPrefix(self, strs):
380 |         ans = ''
381 |         for i in zip(*strs):
382 |             if len(set(i)) == 1:
383 |                 ans += i[0]
384 |             else:
385 |                 break
386 |         return ans
387 | ```
388 | 
389 | ##  重复的子字符串
390 | 
391 | 给定一个非空的字符串，判断它是否可以由它的一个子串重复多次构成。给定的字符串只含有小写英文字母，并且长度不超过10000。
392 | 
393 | 示例 1:
394 | 输入: "abab"
395 | 输出: True
396 | 解释: 可由子字符串 "ab" 重复两次构成。
397 | 
398 | 示例 2:
399 | 输入: "aba"
400 | 输出: False
401 | 
402 | 示例 3:
403 | 输入: "abcabcabcabc"
404 | 输出: True
405 | 解释: 可由子字符串 "abc" 重复四次构成。 (或者子字符串 "abcabc" 重复两次构成。)
406 | 
407 | - 解题思路
408 | 
409 | 第一眼看上去就是先找到字串，然后replace替换，剩下的字串为空即为true
410 | 
411 | ```r
412 | s='abcabca'
413 | m=""
414 | for i in s:
415 |     if i not in m:
416 |         m+=i
417 | if s.replace('abc','')=='':
418 |     print('true')
419 | else:
420 |     print('false')
421 | ```
422 | 
423 | 
424 | 
425 | ## z形树或者N形树问题
426 | 
427 | - 题目描述
428 | 
429 | 将一个给定字符串根据给定的行数，以从上往下、从左到右进行Z 字形排列。
430 | 
431 | 比如输入字符串为 "LEETCODEISHIRING" 行数为 3 时，排列如下：
432 | 
433 | ```r
434 | 
435 | L   C   I   R
436 | E T O E S I I G
437 | E   D   H   N
438 | ```
439 | 之后，你的输出需要从左往右逐行读取，产生出一个新的字符串，比如："LCIRETOESIIGEDHN"。
440 | 
441 | 请你实现这个将字符串进行指定行数变换的函数：
442 | 
443 | string convert(string s, int numRows);
444 | 示例 1:
445 | 
446 | 输入: s = "LEETCODEISHIRING", numRows = 3
447 | 输出: "LCIRETOESIIGEDHN"
448 | 示例 2:
449 | 
450 | 输入: s = "LEETCODEISHIRING", numRows = 4
451 | 输出: "LDREOEIIECIHNTSG"
452 | 解释:
453 | 
454 | ```r
455 | L     D     R
456 | E   O E   I I
457 | E C   I H   N
458 | T     S     G
459 | ```
460 | 
461 | - 解题思路：
462 | 题目理解:
463 | 。字符串 $\quad s \quad$ 是以 $Z$ 字形为顺序存储的字符串, 目标是按行打印。
464 | $\circ$ 设 numRows 行字符串分别为 $s_{1}, s_{2}, \ldots, s_{n},$ 则容易发现：按顺序遍历字符串 $s$ 时, 每个字符 $\quad$ c 在 $Z$ 字形中对应的 行索引 先从 $s_{1}$ 增大至 $s_{n},$ 再从 $s_{n}$ 减小至 $s_{1} \ldots \ldots$ 如此反复。 因此, 解决方案为：模拟这个行索引的变化, 在遍历 $s$ 中把每个字符填到正确的行 res[i]
465 | 算法流程：按顺序遍历字符串 $\quad s$;
466 | 1. res[i] += c : 把每个字符 $c$ 填入对应行 $s_{i}$
467 | 2. i += flag : 更新当前字符 c 对应的行索引;
468 | 3. flag = - flag : 在达到 Z 字形转折点时，执行反向。
469 | 复杂度分析：
470 | 。时间复杂度 $O(N):$ 遍历一遍字符串 $s$;
471 | $\circ$ 空间复杂度 $O(N):$ 各行字符串共占用 $O(N)$ 额外空间。
472 | 
473 | ```r
474 | 
475 | class Solution:
476 |     def convert(self, s: str, numRows: int) -> str:
477 |         if numRows<2:
478 |             return s
479 |         res=["" for _ in range(numRows)]
480 |         i,flag=0,-1
481 |         for c in s:
482 |             res[i] += c
483 |             if i ==0 or i == numRows-1:
484 |                 flag=-flag
485 | 
486 |                 i+=flag
487 |             return "".join(res)
488 | 
489 | 
490 | ```
491 | 
492 | ## 连续字符串计数
493 | 
494 | string = "aaabbcc"
495 | 输出：“ a3b2c2”
496 | ```r
497 | 
498 | coded = ''
499 | while string:
500 |     i = 0
501 |     while i < len(string) and string[0] == string[i]:
502 |         i += 1
503 |     coded += string[0]+str(i)
504 |     string = string[i:]
505 | 
506 | print(coded)
507 | ```
508 | 
509 | ## 滑动窗口模版
510 | 
511 | 就感觉这个模板有点复杂
512 | 
513 | ```r
514 | 初始化窗口端点L，R，一般L为0，R为1
515 |     初始化最优值
516 |     while R < len(Array):
517 |         while R < len(Array):
518 |             R += 1              #移动右端点
519 |             if R < len(Array):
520 |                 更新状态        
521 |             if 状态满足条件:
522 |                 可选的更新最优值的位置
523 |                 break           #一旦满足条件即跳出
524 |         if R == len(Array):     # 若循环是由于移动到数组末尾结束，则停止整个程序。因为之后已经不再有可能的解
525 |             break
526 |         while L < R:
527 |             更新状态    # 移动左端点，需要更新状态
528 |             L += 1
529 |             if 状态满足条件：
530 |                 可选的更新最优值的位置
531 |             else：  # 一旦窗口所在区间不再满足条件即跳出，去移动右端点
532 |                 break
533 |         可选的对于L，R端点的后续处理
534 |     return 最优值
535 | ```
536 | 
537 | 没有什么比理解题意直接套模版更爽的，字符串这里很多题会用到滑动窗口
538 | 
539 | 
540 | 


--------------------------------------------------------------------------------
/analysis/huisu.Rmd:
--------------------------------------------------------------------------------
  1 | ---
  2 | title : 回溯专题
  3 | author: 高文欣
  4 | date: "`r Sys.Date()`"
  5 | output: bookdown::gitbook
  6 | bibliography: ../refs/add.bib
  7 | ---
  8 | 
  9 | # 回溯专题
 10 | 
 11 | ## 定义
 12 | 
 13 | 参考[【代码随想录】](https://github.com/youngyangyang04/leetcode-master/blob/master/problems/%E5%9B%9E%E6%BA%AF%E7%AE%97%E6%B3%95%E7%90%86%E8%AE%BA%E5%9F%BA%E7%A1%80.md)
 14 | 
 15 | 回溯是递归的副产品
 16 | - 回溯法解决的问题
 17 | 
 18 | - 组合问题：N个数里面按一定规则找出k个数的集合
 19 | 
 20 | - 切割问题：一个字符串按一定规则有几种切割方式
 21 | 
 22 | - 子集问题：一个N个数的集合里有多少符合条件的子集
 23 | 
 24 | - 排列问题：N个数按一定规则全排列，有几种排列方式
 25 | 
 26 | - 棋盘问题：N皇后，解数独等等
 27 | 
 28 | 
 29 | 另外，会有一些同学可能分不清什么是组合，什么是排列？
 30 | 
 31 | 组合是不强调元素顺序的，排列是强调元素顺序。
 32 | 
 33 | 例如：{1, 2} 和 {2, 1} 在组合上，就是一个集合，因为不强调顺序，而要是排列的话，{1, 2} 和 {2, 1} 就是两个集合了。
 34 | 
 35 | 记住组合无序，排列有序，就可以了。
 36 | 
 37 | - 如何理解回溯法
 38 | 
 39 | >回溯法解决的问题都可以抽象为树形结构，因为回溯法解决的都是在集合中递归查找子集，集合的大小就构成了树的宽度，递归的深度，都构成的树的深度。递归就要有终止条件，所以必然是一颗高度有限的树（N叉树）。
 40 | 
 41 | 总之,一句话本质上还是递归，既包含二叉树的前序遍历又包含二叉树的后序遍历。
 42 | 
 43 | 
 44 | ## 解决方法
 45 | 
 46 | 主要包含三个点
 47 | 
 48 | - 定义路径
 49 | 
 50 | - 出口条件
 51 | 
 52 | - 做出选择
 53 | 
 54 | 一般基于模板的变形就是在出口条件和做出选择的地方进行变形
 55 | 
 56 | - 下面是一个标准化的模板
 57 | ```r
 58 | res = []
 59 | def backtrack(路径, 选择列表):
 60 |     if 满足结束条件:
 61 |         res.append(路径)
 62 |         return  
 63 |         
 64 |     if 满足剪枝条件：
 65 |     	return
 66 |     	
 67 |     for 选择 in 选择列表:
 68 |         做选择
 69 |         backtrack(路径, 选择列表)
 70 |         撤销选择
 71 | 
 72 | ``` 
 73 | 
 74 | ## 全排列问题一
 75 | 
 76 | 给定一个不含重复数字的数组 nums ，返回其 所有可能的全排列 。你可以 按任意顺序 返回答案。
 77 | 
 78 |  
 79 | 
 80 | 示例 1：
 81 | 
 82 | 输入：nums = [1,2,3]
 83 | 输出：[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
 84 | 示例 2：
 85 | 
 86 | 输入：nums = [0,1]
 87 | 输出：[[0,1],[1,0]]
 88 | 示例 3：
 89 | 
 90 | 输入：nums = [1]
 91 | 输出：[[1]]
 92 | 
 93 | 
 94 | ```r
 95 | class Solution:
 96 |     def permute(self, nums: List[int]) -> List[List[int]]:
 97 |         res = []
 98 |         def backtrack(nums, tmp):
 99 |             if not nums:
100 |                 res.append(tmp)
101 |                 return 
102 |             for i in range(len(nums)):
103 |                 backtrack(nums[:i] + nums[i+1:], tmp + [nums[i]])
104 |         backtrack(nums, [])
105 |         return res
106 | 
107 | ```
108 | 
109 | 
110 | 
111 | ## 全排列问题二
112 | 
113 | - 题目描述
114 | 
115 | 给定一个可包含重复数字的序列 nums ，按任意顺序 返回所有不重复的全排列。
116 | 
117 |  
118 | 
119 | 示例 1：
120 | 
121 | 输入：nums = [1,1,2]
122 | 输出：
123 | [[1,1,2],
124 |  [1,2,1],
125 |  [2,1,1]]
126 | 示例 2：
127 | 
128 | 输入：nums = [1,2,3]
129 | 输出：[[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
130 | 
131 | - 解题思路
132 | 
133 | 套模板
134 | 
135 | 
136 | ```r
137 | class Solution(object):
138 |     def permute(self, nums):
139 |         """
140 |         :type nums: List[int]
141 |         :rtype: List[List[int]]
142 |         """
143 |         res=[]
144 |         track=[] #路径
145 |         def backtrack(track):
146 |             if len(track)==len(nums):# 出口条件
147 |                 res.append(track.copy()) # 把track的副本加入res中，避免后面修改track时产生影响
148 |                 return 
149 |             for i in nums: # 做选择
150 |                 if i not in track:
151 |                     track.append(i)
152 |                     backtrack(track) # 递归
153 |                     track.pop() # 退栈。回溯
154 |         backtrack(track)
155 |         return res
156 |         
157 | ```
158 | 
159 | - copy
160 | 
161 | 这个是浅拷贝，是有关py的底层原理
162 | 
163 | a=b此时a是拷贝了b的引用
164 | 
165 | 
166 | 
167 | 
168 | 
169 | 
170 | ## 组合总和一
171 | 
172 | - 题目描述
173 | 
174 | 给定一个无重复元素的正整数数组 candidates 和一个正整数 target ，找出 candidates 中所有可以使数字和为目标数 target 的唯一组合。
175 | 
176 | candidates 中的数字可以无限制重复被选取。如果至少一个所选数字数量不同，则两种组合是唯一的。 
177 | 
178 | 对于给定的输入，保证和为 target 的唯一组合数少于 150 个。
179 | 
180 | 示例 1：
181 | 
182 | 输入: candidates = [2,3,6,7], target = 7
183 | 输出: [[7],[2,2,3]]
184 | 示例 2：
185 | 
186 | 输入: candidates = [2,3,5], target = 8
187 | 输出: [[2,2,2,2],[2,3,3],[3,5]]
188 | 示例 3：
189 | 
190 | 输入: candidates = [2], target = 1
191 | 输出: []
192 | 示例 4：
193 | 
194 | 输入: candidates = [1], target = 1
195 | 输出: [[1]]
196 | 示例 5：
197 | 
198 | 输入: candidates = [1], target = 2
199 | 输出: [[1,1]]
200 | 
201 | - 解题思路
202 | 
203 | 定义路径
204 | 定义出口
205 | 选择条件
206 | 
207 | 这道题主要就是在出口和选择条件处做的变形
208 | 
209 | 
210 | ```r
211 | class Solution:
212 |     def combinationSum(self, candidates: List[int], target: int) -> List[List[int]]:
213 |         res=[]
214 |         track=[]
215 |         def backtrack(track):
216 |             if sum(track)==target:
217 |                 res.append(track.copy())
218 |                 return 
219 |             if sum(track)>target:
220 |                 return 
221 |             for i in candidates:
222 |                 if track and i < max(track):
223 |                     continue
224 |                 track.append(i)
225 |                 backtrack(track)
226 |                 track.pop()
227 |         backtrack(track)
228 |         return res
229 | ```
230 | 
231 | ## 组合总和二
232 | 
233 | - 题目描述
234 | 
235 | 给定一个数组 candidates 和一个目标数 target ，找出 candidates 中所有可以使数字和为 target 的组合。
236 | candidates 中的每个数字在每个组合中只能使用一次。
237 | 
238 | 注意：解集不能包含重复的组合。 
239 | 示例 1:
240 | 
241 | 输入: candidates = [10,1,2,7,6,1,5], target = 8,
242 | 输出:
243 | [
244 | [1,1,6],
245 | [1,2,5],
246 | [1,7],
247 | [2,6]
248 | ]
249 | 示例 2:
250 | 
251 | 输入: candidates = [2,5,2,1,2], target = 5,
252 | 输出:
253 | [
254 | [1,2,2],
255 | [5]
256 | ]
257 | 
258 | - 解题思路
259 | 
260 | 模板还是那个模板，只是题目稍作修改，增加了一个每个元素不重复
261 | 
262 | 思路不能变，但是需要增加辅助条件
263 | 
264 | ```r
265 | class Solution:
266 |     def combinationSum2(self, candidates, target):
267 |         res=[]
268 |         track=[]
269 |         candidates.sort() # 定义完路径增加一个排序
270 |         def backtrack(j,track):
271 |             if sum(track)==target: # 出口条件依然不变
272 |                 res.append(track.copy())
273 |                 return
274 |             if sum(track)>target:
275 |                 return
276 |             for i in range(j,len(candidates)): # 但是选择条件这里需要增加一个计数，保证选择的元素不重复，赶紧是一个指针的思想
277 |                 if i>j and candidates[i] == candidates[i - 1] :
278 |                     continue
279 |                 
280 |                 track.append(candidates[i])
281 |                 backtrack(i+1,track)
282 |                 track.pop()
283 |         backtrack(0,track)
284 |         return res
285 | ```
286 | 
287 | - 仔细观察这个题，还是选择这里做出了一丢丢的改变
288 | 
289 | ## 组合总和三
290 | 
291 | - 题目描述
292 | 
293 | 找出所有相加之和为 n 的 k 个数的组合。组合中只允许含有 1 - 9 的正整数，并且每种组合中不存在重复的数字。
294 | 
295 | 说明：
296 | 所有数字都是正整数。
297 | 解集不能包含重复的组合。 
298 | 示例 1:
299 | 
300 | 输入: k = 3, n = 7
301 | 输出: [[1,2,4]]
302 | 示例 2:
303 | 
304 | 输入: k = 3, n = 9
305 | 输出: [[1,2,6], [1,3,5], [2,3,4]]
306 | 
307 | - 解题思路
308 | 
309 | 修改出口-选择
310 | 
311 | ```r
312 | class Solution:
313 |     def combinationSum3(self, k: int, n: int) -> List[List[int]]:
314 |         res=[]
315 |         track=[]
316 |         def backtrack(j,track):
317 |             if sum(track)==n and len(track)==k:
318 |                 res.append(track.copy())
319 |                 return
320 |             if len(track)==k:
321 |                 return
322 |             for i in range(j,10):
323 |                 track.append(i)
324 |                 backtrack(i+1,track)
325 |                 track.pop()
326 |         backtrack(1,track)
327 |         return res
328 | ```
329 | 
330 | 找到感觉了，肝~
331 | 
332 | ## 组合总和四
333 | 
334 | - 题目描述
335 | 
336 | 给你一个由 不同 整数组成的数组 nums ，和一个目标整数 target 。请你从 nums 中找出并返回总和为 target 的元素组合的个数。
337 | 
338 | 题目数据保证答案符合 32 位整数范围。
339 | 
340 |  
341 | 
342 | 示例 1：
343 | 
344 | 输入：nums = [1,2,3], target = 4
345 | 输出：7
346 | 解释：
347 | 所有可能的组合为：
348 | (1, 1, 1, 1)
349 | (1, 1, 2)
350 | (1, 2, 1)
351 | (1, 3)
352 | (2, 1, 1)
353 | (2, 2)
354 | (3, 1)
355 | 请注意，顺序不同的序列被视作不同的组合。
356 | 示例 2：
357 | 
358 | 输入：nums = [9], target = 3
359 | 输出：0
360 | 
361 | - 解题思路
362 | 
363 | 依然是套模板，不过这道题用回溯会超出时间限制
364 | 
365 | ```r
366 | class Solution:
367 |     def combinationSum4(self, nums: List[int], target: int) -> int:
368 |         res=[]
369 |         track=[]
370 |         def backtrack(track):
371 |             if sum(track)==target:
372 |                 res.append(track.copy())
373 |                 return 
374 |             if sum(track)>target:
375 |                 return
376 |             for i in nums:
377 |                 track.append(i)
378 |                 backtrack(track)
379 |                 track.pop()
380 |         backtrack(track)
381 |         return len(res)
382 | ```
383 | 
384 | 后面还是会把这个题写到dp里面
385 | 
386 | ## 分割回文字符串
387 | 
388 | - 题目描述
389 | 
390 | 给你一个字符串 s，请你将 s 分割成一些子串，使每个子串都是 回文串 。返回 s 所有可能的分割方案。
391 | 
392 | 回文串 是正着读和反着读都一样的字符串。
393 | 
394 | 示例 1：
395 | 
396 | 输入：s = "aab"
397 | 输出：[["a","a","b"],["aa","b"]]
398 | 示例 2：
399 | 
400 | 输入：s = "a"
401 | 输出：[["a"]]
402 | 
403 | - 解题思路
404 | 
405 | 套模板
406 | 
407 | ```r
408 | class Solution:
409 |     def partition(self, s: str) -> List[List[str]]:
410 |         res = []  
411 |         track = []  #放已经回文的子串
412 |         def backtrack(s,startIndex):
413 |             if startIndex >= len(s):  #如果起始位置已经大于s的大小，说明已经找到了一组分割方案了
414 |                 return res.append(track.copy())
415 |             for i in range(startIndex,len(s)):
416 |                 p = s[startIndex:i+1]  #获取[startIndex,i+1]在s中的子串
417 |                 if p == p[::-1]: 
418 |                     track.append(p)  #是回文子串
419 |                 else: 
420 |                     continue  #不是回文，跳过
421 |                 backtrack(s,i+1)  #寻找i+1为起始位置的子串
422 |                 track.pop()  #回溯过程，弹出本次已经填在path的子串
423 |         backtrack(s,0)
424 |         return res
425 | ```
426 | 
427 | ## 括号生成
428 | 
429 | 解题思路：回溯+深度优先搜索
430 | 
431 | 数字 n 代表生成括号的对数，请你设计一个函数，用于能够生成所有可能的并且 有效的 括号组合。
432 | 
433 |  
434 | 
435 | 示例 1：
436 | 输入：n = 3
437 | 输出：["((()))","(()())","(())()","()(())","()()()"]
438 | 
439 | 示例 2：
440 | 输入：n = 1
441 | 输出：["()"]
442 | 
443 | 
444 | ```r
445 | from typing import List
446 | 
447 | 
448 | class Solution:
449 |     def generateParenthesis(self, n: int) -> List[str]:
450 | 
451 |         res = []
452 |         cur_str = ''
453 | 
454 |         def dfs(cur_str, left, right, n):
455 |             """
456 |             :param cur_str: 从根结点到叶子结点的路径字符串
457 |             :param left: 左括号已经使用的个数
458 |             :param right: 右括号已经使用的个数
459 |             :return:
460 |             """
461 |             if left == n and right == n:
462 |                 res.append(cur_str)
463 |                 return
464 |             if left < right:
465 |                 return
466 | 
467 |             if left < n:
468 |                 dfs(cur_str + '(', left + 1, right, n)
469 | 
470 |             if right < n:
471 |                 dfs(cur_str + ')', left, right + 1, n)
472 | 
473 |         dfs(cur_str, 0, 0, n)
474 |         return res
475 | 
476 | 
477 | 
478 | ```
479 |  
480 | [liweiwei1419](https://leetcode.cn/problems/generate-parentheses/solution/hui-su-suan-fa-by-liweiwei1419/)
481 | 
482 | 
483 | ## 单词搜索
484 | 
485 | ![](../figs/dcss1.png)
486 | ![](../figs/dcss2.png)
487 | 
488 | 比较典型的无重复回溯，但是不好写
489 | 
490 | ```r
491 | class Solution:
492 |     def exist(self, board: List[List[str]], word: str) -> bool:
493 |         # dfs，找到与word相匹配的单词
494 |         m, n = len(board), len(board[0])
495 |         w = len(word)
496 | 
497 |         # i, j为当前坐标，k为当前word匹配到的坐标
498 |         def dfs(i, j, k):
499 |             # 当索引越界，或当前不匹配，或搜索已访问过的坐标时，进行剪枝
500 |             if not 0 <= i < m or not 0 <= j < n or board[i][j] != word[k]: return False
501 |             # 当最后一个字母匹配时，搜索成功
502 |             if k == w - 1: return True
503 |             # 将访问过的字符暂时置为空
504 |             board[i][j] = ''
505 |             # 有上下左右四个搜索方向，搜索下一个字母
506 |             res = dfs(i+1, j, k+1) or dfs(i-1, j, k+1) or dfs(i, j-1, k+1) or dfs(i, j+1, k+1)
507 |             # 将访问过的字符还原
508 |             board[i][j] = word[k]
509 |             return res
510 |         
511 |         # 共有MN个起点，每个起点除去回头路有三个搜索方向，故时间复杂度为3**k*MN
512 |         for i in range(m):
513 |             for j in range(n):
514 |                 if dfs(i, j, 0): return True
515 |         return False
516 | 
517 | 
518 | ```
519 | 
520 | [bullimito](https://leetcode.cn/problems/word-search/solution/dfs-by-bullimito-1ate/)
521 | 
522 | 
523 | 
524 | 
525 | ## 电话号码的字母组合
526 | 
527 | 题目描述
528 | 
529 | ![](../figs/dhhmzh.png)
530 | 
531 | 
532 | ```r
533 | class Solution:
534 |     def letterCombinations(self, digits: str) -> List[str]:
535 |         dic = {'2':'abc', '3':'def', '4':'ghi', '5':'jkl', '6':'mno', '7':'pqrs','8':'tuv','9':'wxyz'} #首先定义一个哈希表，把相应的数字和字母对应起来
536 |         n = len(digits) #计算给定字符串中数字的长度
537 |         if n == 0:
538 |             return []
539 | 
540 |         def dfs(index): #定义递归回溯函数
541 |             if index == n: #如果此时递归到了字符串中最后一个数字，则表示第一层深度搜索结束，将结果存储起来
542 |                 res.append(''.join(tmp)) #注意一下这边存储的时候要把多个字符串组合成一个字符串，利用
543 |                 #join函数，这边还要注意的是后面会把tmp中的最上面字符弹出，这边利用join函数也同时避免
544 |                 #了tmp弹出时影响res的目的，不然全部返回空字符串
545 |             else: #如果这个时候没搜索到最后一层，则
546 |                 for i in dic[digits[index]]: #逐个遍历当前数字对应的字母
547 |                     tmp.append(i) #将这个字母加到tmp中
548 |                     dfs(index + 1) #因为要把下一个数字对应的字母继续加进去，所以这边index + 1，函数传递下一个位置
549 |                     tmp.pop() #因为还需要把最后一个数字的字母逐个加进去，所以这边要把最后一个弹出，
550 |                     #因为上一行的dfs函数遇到结束条件，才回向下执行，所以这边已经完成一次深度的搜索，此时要把最后一个字母弹出，实现下一轮遍历
551 |         
552 | 
553 |         res = [] #初始化返回结果数组
554 |         tmp = [] #初始化过渡数组
555 |         dfs(0) #首先执行index = 0，因为都是从第一个字母开始组合
556 |         return res #返回结果函数
557 | 
558 | 
559 | ```
560 | 
561 | [a-jun-bao-1234](https://leetcode.cn/problems/letter-combinations-of-a-phone-number/solution/17-dian-hua-hao-ma-de-zi-mu-zu-he-di-gui-tcxk/)
562 | 
563 | ## N皇后
564 | 
565 | 
566 | 
567 | 
568 | 
569 | 
570 | 
571 | 
572 | 


--------------------------------------------------------------------------------