-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path草稿.txt
91 lines (84 loc) · 6.7 KB
/
草稿.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
[:authority:](github.com)
[:method:](GET)
[:path:](/labuladong/challenge/issues)
[:scheme:](https)
[accept:](text/html,application/xhtml+xml,application/xml;q=0.9,image/avif,image/webp,image/apng,*/*;q=0.8,application/signed-exchange;v=b3;q=0.9)
[accept-encoding: gzip, deflate,](br)
[accept-language:](zh-CN,zh;q=0.9)
[cache-control:](max-age=0)
[cookie: _octo=GH1.1.740944638.1628754231; _device_id=5f57192446afa215a977844d244be53f; tz=Asia%2FShanghai; tz=Asia%2FShanghai; color_mode=%7B%22color_mode%22%3A%22auto%22%2C%22light_theme%22%3A%7B%22name%22%3A%22light%22%2C%22color_mode%22%3A%22light%22%7D%2C%22dark_theme%22%3A%7B%22name%22%3A%22dark%22%2C%22color_mode%22%3A%22dark%22%7D%7D; user_session=Zij1dWQXpFTr_0a9RT0Wd5bOhctB0MPTu53pjhqg6aNPnfAu; __Host-user_session_same_site=Zij1dWQXpFTr_0a9RT0Wd5bOhctB0MPTu53pjhqg6aNPnfAu; logged_in=yes; dotcom_user=Tom-DaLin; has_recent_activity=1;](_gh_sess=KtV7HbYJDlcbmcuqhRH97no4VQ8AYk%2F1mf5P1p3j7enBC2nrji5OMvjkFI1azQSNMbaEGLEkeEZAbrAleZ6za6gN4hQKdXf9pXlNQVxG50XsfIebLEqo9jbJPyLKfz3YHoCTdDYFiPkDzqgm3MHcCh9Ys3m%2FxPJINzbV85H1iSKZHxAr8w3%2Be5c0VTABHHTvba7WqxRDWbvzjyDVhDAIgkwAmpxhl8bd9VMFaYPTdmtgWJ%2BttobThk9lfPKwCVf9orGIjtshbpmM5CZkssRmdMd4v3ohxAF7UCbNGFs7e%2BHvBUJLh2qKTAPZ%2BmC8VXaBWgik2gdT2AqAWFaXEwPmhO95zG1WMAXvGebEjMmsNtgAVbCZVfZAKlmhylYoXbvZVFaIqXz%2Bwi2J9%2B%2FOOyDbjHtIqPfTqqQXd0sqevEgNuA5QQpq3xApcBXd%2BNPRze3Z4SvQB%2BAYjerMqp%2BM%2FLLO5uSDHNJIy55BjKIw1o6djoTPPYFnauDgqNc2fWf64OMOrw3ZC0pX%2BavISE2Au1Cr%2BKvORXA9zzZw7hpZrI2fJaamt%2BJvd0q67yTS8uf7I%2F7hA1QxsyPCxXlZGnz3ioCSdXofl3geQ%2FVItoP%2FhZRTCvQaq8TURwcPcSx63C8Z7F8rgFuaSk%2FspsHoGgo2UbiOsL%2Bx45tAPVlOUHpsm9D8NAVlQIvKS0yxF2jTPIasL8gi6m7aEffuvmzvBRZga5%2FqOens6dEWKtJJBnLgomeF5fVn0rg9ljy%2F%2BqLGOM%2Fitc6SCCrjKkhELHXg0kow--dhT8%2FWGHzTwKDb2T--xbX%2BeX%2BS5ptPPdShkOQgUA%3D%3D)
[if-none-match:](W/"f2b45a3570d32256bcd64fc3ee226d0a")
[referer:](https://github.com/labuladong)
[sec-ch-ua: " Not;A Brand";v="99", "Google Chrome";v="97",]("Chromium";v="97")
[sec-ch-ua-mobile:](?0)
[sec-ch-ua-platform:]("Windows")
[sec-fetch-dest:](document)
[sec-fetch-mode:](navigate)
[sec-fetch-site:](same-origin)
[sec-fetch-user:](?1)
[upgrade-insecure-requests:](1)
[user-agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/97.0.4692.99 Safari/537.36<div class="js-navigation-container](js-active-navigation-container">)
[{'issue_id': 46, 'data_id':](1112893683},)
[{'issue_id': 45, 'data_id':](1111895236},)
[{'issue_id': 44, 'data_id':](1111613887},)
[{'issue_id': 43, 'data_id':](1111194536},)
[{'issue_id': 42, 'data_id':](1109520975},)
[{'issue_id': 41, 'data_id':](1108632725},)
[{'issue_id': 40, 'data_id':](1107117260},)
[{'issue_id': 39, 'data_id':](1106066770},)
[{'issue_id': 38, 'data_id':](1105322273},)
[{'issue_id': 37, 'data_id':](1104886301},)
[{'issue_id': 36, 'data_id':](1104179494},)
[{'issue_id': 35, 'data_id':](1102051261},)
[{'issue_id': 34, 'data_id':](1100528865},)
[{'issue_id': 33, 'data_id':](1099335683},)
[{'issue_id': 32, 'data_id':](1098054599},)
[{'issue_id': 31, 'data_id':](1097206181},)
[{'issue_id': 30, 'data_id':](1096966902},)
[{'issue_id': 29, 'data_id':](1096445353},)
[{'issue_id': 27, 'data_id':](1095457418},)
[{'issue_id': 26, 'data_id':](1094512019},)
[{'issue_id': 25, 'data_id':](1093495976},)
[{'issue_id': 23, 'data_id':](1092960278},)
[魔塔游戏](https://labuladong.gitee.io/plugin-v3/?qno=174)
[编辑距离](https://labuladong.gitee.io/plugin-v3/?qno=72)
[最长递增子序列](https://labuladong.gitee.io/plugin-v3/?qno=300)
[动态规划核心原理](https://labuladong.gitee.io/plugin-v3/?qno=322)
[子集划分问题](https://labuladong.gitee.io/plugin-v3/?qno=698&target=gitee&_=1642696536440)
[回溯算法解决排列/组合/子集问题](https://labuladong.gitee.io/plugin-v3/?qno=77)
[回溯算法核心原理](https://labuladong.gitee.io/plugin-v3/?qno=51)
[BFS 算法基础](https://labuladong.gitee.io/plugin-v3/?qno=752)
[二分图判定算法](https://labuladong.gitee.io/plugin-v3/?qno=785&target=gitee&_=1642389518965)
[图论算法基础](https://labuladong.gitee.io/plugin-v3/?qno=797&target=gitee&_=1642288864543)
[二叉搜索树基础操作](https://labuladong.gitee.io/plugin-v3/?qno=450)
[二叉树算法入门](https://labuladong.gitee.io/plugin-v3/?qno=116&target=gitee)
[LRU 算法设计](https://labuladong.gitee.io/plugin-v3/?qno=146&target=gitee&_=1642200488200)
[如何在数组中以 O(1) 删除元素](https://labuladong.gitee.io/algo/2/20/61/)
[递归反转链表：如何拆解复杂问题](https://labuladong.gitee.io/algo/2/16/16/)
[二分搜索技巧](https://labuladong.gitee.io/algo/1/9/)
[滑动窗口技巧](https://mp.weixin.qq.com/s/ioKXTMZufDECBUwRRp3zaA)
[二维数组花式遍历技巧盘点](https://mp.weixin.qq.com/s/8jkzRKLNT-6CnEkvHp0ztA)
[小而美的算法技巧：差分数组技巧](https://mp.weixin.qq.com/s/123QujqVn3--gyeZRhxR-A)
[小而美的算法技巧：前缀和数组](https://mp.weixin.qq.com/s/EwAH3JDs5WFO6-LFmI3-2Q)
[单链表的六大解题套路，你都见过么？](https://mp.weixin.qq.com/s/dVqXEMKZ6_tuB7J-leLmtg)
[单链表的六大解题套路，你都见过么？](https://mp.weixin.qq.com/s/dVqXEMKZ6_tuB7J-leLmtg)
[小而美的算法技巧：前缀和数组](https://mp.weixin.qq.com/s/EwAH3JDs5WFO6-LFmI3-2Q)
[小而美的算法技巧：差分数组技巧](https://mp.weixin.qq.com/s/123QujqVn3--gyeZRhxR-A)
[二维数组花式遍历技巧盘点](https://mp.weixin.qq.com/s/8jkzRKLNT-6CnEkvHp0ztA)
[滑动窗口技巧](https://mp.weixin.qq.com/s/ioKXTMZufDECBUwRRp3zaA)
[二分搜索技巧](https://labuladong.gitee.io/algo/1/9/)
[递归反转链表：如何拆解复杂问题](https://labuladong.gitee.io/algo/2/16/16/)
[如何在数组中以 O(1) 删除元素](https://labuladong.gitee.io/algo/2/20/61/)
[LRU 算法设计](https://labuladong.gitee.io/plugin-v3/?qno=146&target=gitee&_=1642200488200)
[二叉树算法入门](https://labuladong.gitee.io/plugin-v3/?qno=116&target=gitee)
[二叉搜索树基础操作](https://labuladong.gitee.io/plugin-v3/?qno=450)
[图论算法基础](https://labuladong.gitee.io/plugin-v3/?qno=797&target=gitee&_=1642288864543)
[二分图判定算法](https://labuladong.gitee.io/plugin-v3/?qno=785&target=gitee&_=1642389518965)
[BFS 算法基础](https://labuladong.gitee.io/plugin-v3/?qno=752)
[回溯算法核心原理](https://labuladong.gitee.io/plugin-v3/?qno=51)
[回溯算法解决排列/组合/子集问题](https://labuladong.gitee.io/plugin-v3/?qno=77)
[子集划分问题](https://labuladong.gitee.io/plugin-v3/?qno=698&target=gitee&_=1642696536440)
[动态规划核心原理](https://labuladong.gitee.io/plugin-v3/?qno=322)
[最长递增子序列](https://labuladong.gitee.io/plugin-v3/?qno=300)
[编辑距离](https://labuladong.gitee.io/plugin-v3/?qno=72)
[魔塔游戏](https://labuladong.gitee.io/plugin-v3/?qno=174)