-
Notifications
You must be signed in to change notification settings - Fork 0
/
index.html
117 lines (104 loc) · 33.5 KB
/
index.html
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
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
<!DOCTYPE html><html lang="en" data-theme="dark"><head><meta charset="UTF-8"><meta http-equiv="X-UA-Compatible" content="IE=edge"><meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=5"><title>Fox Chen</title><meta name="description" content=""><meta name="author" content="Fox Chen"><meta name="copyright" content="Fox Chen"><meta name="format-detection" content="telephone=no"><link rel="shortcut icon" href="/img/favicon.ico"><link rel="preconnect" href="//cdn.jsdelivr.net"><link rel="preconnect" href="https://fonts.googleapis.com" crossorigin><link rel="preconnect" href="//busuanzi.ibruce.info"><meta name="twitter:card" content="summary"><meta name="twitter:title" content="Fox Chen"><meta name="twitter:description" content=""><meta name="twitter:image" content="http://yoursite.com/img/hello.jpg"><meta property="og:type" content="website"><meta property="og:title" content="Fox Chen"><meta property="og:url" content="http://yoursite.com/"><meta property="og:site_name" content="Fox Chen"><meta property="og:description" content=""><meta property="og:image" content="http://yoursite.com/img/hello.jpg"><meta http-equiv="Cache-Control" content="no-transform"><meta http-equiv="Cache-Control" content="no-siteapp"><script src="https://cdn.jsdelivr.net/npm/js-cookie/dist/js.cookie.min.js"></script><script>const autoChangeMode = 'false'
var t = Cookies.get("theme");
if (autoChangeMode == '1'){
const isDarkMode = window.matchMedia("(prefers-color-scheme: dark)").matches
const isLightMode = window.matchMedia("(prefers-color-scheme: light)").matches
const isNotSpecified = window.matchMedia("(prefers-color-scheme: no-preference)").matches
const hasNoSupport = !isDarkMode && !isLightMode && !isNotSpecified
if (t === undefined){
if (isLightMode) activateLightMode()
else if (isDarkMode) activateDarkMode()
else if (isNotSpecified || hasNoSupport){
console.log('You specified no preference for a color scheme or your browser does not support it. I Schedule dark mode during night time.')
now = new Date();
hour = now.getHours();
isNight = hour < 6 || hour >= 18
isNight ? activateDarkMode() : activateLightMode()
}
} else if (t == 'light') activateLightMode()
else activateDarkMode()
} else if (autoChangeMode == '2'){
now = new Date();
hour = now.getHours();
isNight = hour < 6 || hour >= 18
if(t === undefined) isNight? activateDarkMode() : activateLightMode()
else if (t === 'light') activateLightMode()
else activateDarkMode()
} else {
if ( t == 'dark' ) activateDarkMode()
else if ( t == 'light') activateLightMode()
}
function activateDarkMode(){
document.documentElement.setAttribute('data-theme', 'dark')
if (document.querySelector('meta[name="theme-color"]') !== null){
document.querySelector('meta[name="theme-color"]').setAttribute('content','#000')
}
}
function activateLightMode(){
document.documentElement.setAttribute('data-theme', 'light')
if (document.querySelector('meta[name="theme-color"]') !== null){
document.querySelector('meta[name="theme-color"]').setAttribute('content','#fff')
}
}</script><link rel="stylesheet" href="/css/index.css"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/font-awesome@latest/css/font-awesome.min.css"><link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/@fancyapps/fancybox@latest/dist/jquery.fancybox.min.css"><link rel="canonical" href="http://yoursite.com/"><link rel="preload" href="https://cdn.jsdelivr.net/gh/jerryc127/[email protected]/top_img/index.jpg" as="image"><link rel="stylesheet" href="https://fonts.googleapis.com/css?family=Titillium+Web"><script>var GLOBAL_CONFIG = {
root: '/',
algolia: undefined,
localSearch: undefined,
translate: {"defaultEncoding":2,"translateDelay":0,"cookieDomain":"https://xxx/","msgToTraditionalChinese":"繁","msgToSimplifiedChinese":"简"},
copy: {
success: 'Copy successfully',
error: 'Copy error',
noSupport: 'The browser does not support'
},
bookmark: {
title: 'Snackbar.bookmark.title',
message_prev: 'Press',
message_next: 'to bookmark this page'
},
runtime_unit: 'days',
runtime: true,
copyright: undefined,
ClickShowText: {"text":"全能,女神,学霸,晴","fontSize":"20px"},
medium_zoom: false,
fancybox: true,
Snackbar: undefined,
baiduPush: false,
isHome: true,
isPost: false
}</script><meta name="generator" content="Hexo 4.2.0"></head><body><header> <div id="page-header"><span class="pull_left" id="blog_name"><a class="blog_title" id="site-name" href="/">Fox Chen</a></span><span class="toggle-menu pull_right close"><a class="site-page"><i class="fa fa-bars fa-fw" aria-hidden="true"></i></a></span><span class="pull_right menus"><div class="menus_items"><div class="menus_item"><a class="site-page" href="/"><i class="fa-fw fa fa-home"></i><span> Home</span></a></div><div class="menus_item"><a class="site-page" href="/archives/"><i class="fa-fw fa fa-archive"></i><span> Archives</span></a></div><div class="menus_item"><a class="site-page" href="/programmer/"><i class="fa-fw fa fa-book"></i><span> Self cultivation of programmers</span></a></div><div class="menus_item"><a class="site-page" href="/tags/"><i class="fa-fw fa fa-tags"></i><span> Tags</span></a></div><div class="menus_item"><a class="site-page"><i class="fa-fw fa fa-list" aria-hidden="true"></i><span> Daily Life</span><i class="fa fa-chevron-down menus-expand" aria-hidden="true"></i></a><ul class="menus_item_child"><li><a class="site-page" href="/music/"><i class="fa-fw fa fa-music"></i><span> Music</span></a></li><li><a class="site-page" href="/vlog/"><i class="fa-fw fa fa-film"></i><span> Vlog</span></a></li><li><a class="site-page" href="/diary/"><i class="fa-fw fa fa-pencil-square-o"></i><span> Diary</span></a></li><li><a class="site-page" href="/delicacy"><i class="fa-fw fa fa-heart"></i><span> Delicacy</span></a></li></ul></div><div class="menus_item"><a class="site-page" href="/link/"><i class="fa-fw fa fa-link"></i><span> Link</span></a></div></div></span></div></header><div id="mobile-sidebar"><div id="menu_mask"></div><div id="mobile-sidebar-menus"><div class="mobile_author_icon"><img class="avatar-img" src="/img/hello.jpg" onerror="onerror=null;src='/img/friend_404.gif'" alt="avatar"></div><div class="mobile_post_data"><div class="mobile_data_item is-center"><div class="mobile_data_link"><a href="/archives/"><div class="headline">Articles</div><div class="length_num">87</div></a></div></div><div class="mobile_data_item is-center"> <div class="mobile_data_link"><a href="/tags/"><div class="headline">Tags</div><div class="length_num">42</div></a></div></div></div><hr><div class="menus_items"><div class="menus_item"><a class="site-page" href="/"><i class="fa-fw fa fa-home"></i><span> Home</span></a></div><div class="menus_item"><a class="site-page" href="/archives/"><i class="fa-fw fa fa-archive"></i><span> Archives</span></a></div><div class="menus_item"><a class="site-page" href="/programmer/"><i class="fa-fw fa fa-book"></i><span> Self cultivation of programmers</span></a></div><div class="menus_item"><a class="site-page" href="/tags/"><i class="fa-fw fa fa-tags"></i><span> Tags</span></a></div><div class="menus_item"><a class="site-page"><i class="fa-fw fa fa-list" aria-hidden="true"></i><span> Daily Life</span><i class="fa fa-chevron-down menus-expand" aria-hidden="true"></i></a><ul class="menus_item_child"><li><a class="site-page" href="/music/"><i class="fa-fw fa fa-music"></i><span> Music</span></a></li><li><a class="site-page" href="/vlog/"><i class="fa-fw fa fa-film"></i><span> Vlog</span></a></li><li><a class="site-page" href="/diary/"><i class="fa-fw fa fa-pencil-square-o"></i><span> Diary</span></a></li><li><a class="site-page" href="/delicacy"><i class="fa-fw fa fa-heart"></i><span> Delicacy</span></a></li></ul></div><div class="menus_item"><a class="site-page" href="/link/"><i class="fa-fw fa fa-link"></i><span> Link</span></a></div></div></div></div><div id="body-wrap"><nav class="full_page" id="nav" style="background-image: url(https://cdn.jsdelivr.net/gh/jerryc127/[email protected]/top_img/index.jpg)"><div id="site-info"><div id="site-title"><span class="blogtitle">Fox Chen</span></div><div id="site-sub-title"><span class="subtitle"></span></div><div id="site-social-icons"><a class="social-icon" href="https://github.com/topfox666" target="_blank"><i class="fa fa-github" aria-hidden="true"></i></a><a class="social-icon" href="https://weibo.com/u/3324382784" target="_blank"><i class="fa fa-weibo" aria-hidden="true"></i></a><a class="social-icon" href="mailto:[email protected]" target="_blank"><i class="fa fa-envelope" aria-hidden="true"></i></a></div></div><div class="scroll-down"><i class="fa fa-angle-down scroll-down-effects"></i></div></nav><main id="content-outer"><div class="layout_page" id="content-inner"><div class="recent-posts" id="recent-posts"><div class="recent-post-item article-container"><div class="post_cover left_radius"><a href="/2020/05/22/offer35-%E6%A0%88%E7%9A%84%E5%8E%8B%E5%85%A5%E5%BC%B9%E5%87%BA%E5%BA%8F%E5%88%97/" title="offer35-栈的压入弹出序列（模拟栈）"><img class="post_bg lazyload" data-src="/img/logo.png" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="offer35-栈的压入弹出序列（模拟栈）"></a></div><div class="recent-post-info"> <a class="article-title" href="/2020/05/22/offer35-%E6%A0%88%E7%9A%84%E5%8E%8B%E5%85%A5%E5%BC%B9%E5%87%BA%E5%BA%8F%E5%88%97/" title="offer35-栈的压入弹出序列（模拟栈）">offer35-栈的压入弹出序列（模拟栈）</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2020-05-22</time><div class="content">题目：输入两个整数序列，第一个序列表示栈的压入顺序，请判断第二个序列是否为该栈的弹出顺序。假设压入栈的所有数字均不相等。例如，序列 {1,2,3,4,5} 是某栈的压栈序列，序列 {4,5,3,2,1} 是该压栈序列对应的一个弹出序列，但 {4,3,5,1,2} 就不可能是该压栈序列的弹出序列。
示 ...</div></div></div><div class="recent-post-item article-container"><div class="post_cover right_radius"><a href="/2020/05/22/offer36-%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20III/" title="offer36-从上到下打印二叉树 III（双端队列）"><img class="post_bg lazyload" data-src="/img/logo.png" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="offer36-从上到下打印二叉树 III（双端队列）"></a></div><div class="recent-post-info"> <a class="article-title" href="/2020/05/22/offer36-%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20III/" title="offer36-从上到下打印二叉树 III（双端队列）">offer36-从上到下打印二叉树 III（双端队列）</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2020-05-22</time><div class="content">题目：请实现一个函数按照之字形顺序打印二叉树，即第一行按照从左到右的顺序打印，第二层按照从右到左的顺序打印，第三行再按照从左到右的顺序打印，其他行以此类推。
示例1：
Code1234567891011121314给定二叉树: [3,9,20,null,null,15,7], 3 / \ ...</div></div></div><div class="recent-post-item article-container"><div class="post_cover left_radius"><a href="/2020/05/22/offer39-%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%A9%E6%B6%A6/" title="offer39-股票的最大利润（滑动窗口）"><img class="post_bg lazyload" data-src="/img/logo.png" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="offer39-股票的最大利润（滑动窗口）"></a></div><div class="recent-post-info"> <a class="article-title" href="/2020/05/22/offer39-%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%A9%E6%B6%A6/" title="offer39-股票的最大利润（滑动窗口）">offer39-股票的最大利润（滑动窗口）</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2020-05-22</time><div class="content">题目：设把某股票的价格按照时间先后顺序存储在数组中，请问买卖该股票一次可能获得的最大利润是多少？
示例1：
Code1234输入: [7,1,5,3,6,4]输出: 5解释: 在第 2 天（股票价格 = 1）的时候买入，在第 5 天（股票价格 = 6）的时候卖出，最大利润 = 6-1 = 5 。 ...</div></div></div><div class="recent-post-item article-container"><div class="post_cover right_radius"><a href="/2020/05/22/offer40-%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91/" title="offer40-从上到下打印二叉树（层序遍历）"><img class="post_bg lazyload" data-src="/img/logo.png" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="offer40-从上到下打印二叉树（层序遍历）"></a></div><div class="recent-post-info"> <a class="article-title" href="/2020/05/22/offer40-%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91/" title="offer40-从上到下打印二叉树（层序遍历）">offer40-从上到下打印二叉树（层序遍历）</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2020-05-22</time><div class="content">题目：从上到下打印出二叉树的每个节点，同一层的节点按照从左到右的顺序打印。
示例1：
Code12345678910给定二叉树: [3,9,20,null,null,15,7] 3 / \ 9 20 / \ 15 7 返回：[3,9,20,15,7]
提示：
Co ...</div></div></div><div class="recent-post-item article-container"><div class="post_cover left_radius"><a href="/2020/05/22/offer38-%E4%B8%91%E6%95%B0/" title="offer38-丑数（动态规划）"><img class="post_bg lazyload" data-src="/img/logo.png" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="offer38-丑数（动态规划）"></a></div><div class="recent-post-info"> <a class="article-title" href="/2020/05/22/offer38-%E4%B8%91%E6%95%B0/" title="offer38-丑数（动态规划）">offer38-丑数（动态规划）</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2020-05-22</time><div class="content">题目：我们把只包含因子 2、3 和 5 的数称作丑数（Ugly Number）。求按从小到大的顺序的第 n 个丑数。
示例：
Code123输入: n = 10输出: 12解释: 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 是前 10 个丑数。
说明:
1 是丑数。
n 不 ...</div></div></div><div class="recent-post-item article-container"><div class="post_cover right_radius"><a href="/2020/05/22/offer43-%E7%A4%BC%E7%89%A9%E7%9A%84%E6%9C%80%E5%A4%A7%E4%BB%B7%E5%80%BC/" title="offer43-礼物的最大价值（动态规划）"><img class="post_bg lazyload" data-src="/img/logo.png" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="offer43-礼物的最大价值（动态规划）"></a></div><div class="recent-post-info"> <a class="article-title" href="/2020/05/22/offer43-%E7%A4%BC%E7%89%A9%E7%9A%84%E6%9C%80%E5%A4%A7%E4%BB%B7%E5%80%BC/" title="offer43-礼物的最大价值（动态规划）">offer43-礼物的最大价值（动态规划）</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2020-05-22</time><div class="content">题目：在一个 m*n 的棋盘的每一格都放有一个礼物，每个礼物都有一定的价值（价值大于 0）。你可以从棋盘的左上角开始拿格子里的礼物，并每次向右或者向下移动一格、直到到达棋盘的右下角。给定一个棋盘及其上面的礼物的价值，请计算你最多能拿到多少价值的礼物？
示例1：
Code12345678输入: [ ...</div></div></div><div class="recent-post-item article-container"><div class="post_cover left_radius"><a href="/2020/05/22/offer44-%E5%A4%8D%E6%9D%82%E9%93%BE%E8%A1%A8%E7%9A%84%E5%A4%8D%E5%88%B6/" title="（***不熟练）offer44-复杂链表的复制（链表）"><img class="post_bg lazyload" data-src="/img/logo.png" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="（***不熟练）offer44-复杂链表的复制（链表）"></a></div><div class="recent-post-info"> <a class="article-title" href="/2020/05/22/offer44-%E5%A4%8D%E6%9D%82%E9%93%BE%E8%A1%A8%E7%9A%84%E5%A4%8D%E5%88%B6/" title="（***不熟练）offer44-复杂链表的复制（链表）">（***不熟练）offer44-复杂链表的复制（链表）</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2020-05-22</time><div class="content">题目：请实现 copyRandomList 函数，复制一个复杂链表。在复杂链表中，每个节点除了有一个 next 指针指向下一个节点，还有一个 random 指针指向链表中的任意节点或者 null。
示例1：
Code12输入：head = [[7,null],[13,0],[11,4],[10,2 ...</div></div></div><div class="recent-post-item article-container"><div class="post_cover right_radius"><a href="/2020/05/22/offer45-%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0/" title="offer45-数组中数字出现的次数（位运算）"><img class="post_bg lazyload" data-src="/img/logo.png" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="offer45-数组中数字出现的次数（位运算）"></a></div><div class="recent-post-info"> <a class="article-title" href="/2020/05/22/offer45-%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0/" title="offer45-数组中数字出现的次数（位运算）">offer45-数组中数字出现的次数（位运算）</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2020-05-22</time><div class="content">题目：一个整型数组 nums 里除两个数字之外，其他数字都出现了两次。请写程序找出这两个只出现一次的数字。要求时间复杂度是O(n)，空间复杂度是O(1)。
示例1：
Code12输入：nums = [4,1,4,6]输出：[1,6] 或 [6,1]
示例2：
Code12输入：nums = [1, ...</div></div></div><div class="recent-post-item article-container"><div class="post_cover left_radius"><a href="/2020/05/22/offer46-%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0II/" title="offer46-数组中数字出现的次数II（位运算）"><img class="post_bg lazyload" data-src="/img/logo.png" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="offer46-数组中数字出现的次数II（位运算）"></a></div><div class="recent-post-info"> <a class="article-title" href="/2020/05/22/offer46-%E6%95%B0%E7%BB%84%E4%B8%AD%E6%95%B0%E5%AD%97%E5%87%BA%E7%8E%B0%E7%9A%84%E6%AC%A1%E6%95%B0II/" title="offer46-数组中数字出现的次数II（位运算）">offer46-数组中数字出现的次数II（位运算）</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2020-05-22</time><div class="content">题目：在一个数组 nums 中除一个数字只出现一次之外，其他数字都出现了三次。请找出那个只出现一次的数字。
示例1：
Code12输入：nums = [3,4,3,3]输出：4
示例2：
Code12输入：nums = [9,1,7,9,7,9,7]输出：1
限制：
1 </div></div></div><div class="recent-post-item article-container"><div class="post_cover right_radius"><a href="/2020/05/22/offer47-%E6%9E%84%E5%BB%BA%E4%B9%98%E7%A7%AF%E6%95%B0%E7%BB%84/" title="offer47-构建乘积数组（数学）"><img class="post_bg lazyload" data-src="/img/logo.png" onerror="this.onerror=null;this.src='/img/404.jpg'" alt="offer47-构建乘积数组（数学）"></a></div><div class="recent-post-info"> <a class="article-title" href="/2020/05/22/offer47-%E6%9E%84%E5%BB%BA%E4%B9%98%E7%A7%AF%E6%95%B0%E7%BB%84/" title="offer47-构建乘积数组（数学）">offer47-构建乘积数组（数学）</a><time class="post-meta__date"><i class="fa fa-calendar" aria-hidden="true"></i> 2020-05-22</time><div class="content">题目：给定一个数组 A[0,1,…,n-1]，请构建一个数组 B[0,1,…,n-1]，其中 B 中的元素 B[i]=A[0]×A[1]×…×A[i-1]×A[i+1]×…×A[n-1]。不能使用除法。
示例1：
Code12输入: [1,2,3,4,5]输出: [120,60,40,30,24]
...</div></div></div><nav id="pagination"><div class="pagination"><span class="page-number current">1</span><a class="page-number" href="/page/2/">2</a><span class="space">…</span><a class="page-number" href="/page/9/">9</a><a class="extend next" rel="next" href="/page/2/"><i class="fa fa-fw fa-chevron-right" aria-hidden="true"></i></a></div></nav></div><div class="aside_content" id="aside_content"><div class="card-widget card-info"><div class="card-content"><div class="card-info-avatar is-center"><img class="avatar-img" src="/img/hello.jpg" onerror="this.onerror=null;this.src='/img/friend_404.gif'" alt="avatar"><div class="author-info__name">Fox Chen</div><div class="author-info__description"></div></div><div class="card-info-data"><div class="card-info-data-item is-center"><a href="/archives/"><div class="headline">Articles</div><div class="length_num">87</div></a></div><div class="card-info-data-item is-center"> <a href="/tags/"><div class="headline">Tags</div><div class="length_num">42</div></a></div></div><div class="card-info-bookmark is-center"><a class="bookmark button--primary button--animated" id="bookmark-it" href="javascript:;" title="Add to bookmark" target="_self"><i class="fa fa-bookmark" aria-hidden="true"></i><span>Add to bookmark</span></a></div><div class="card-info-social-icons is-center"><a class="social-icon" href="https://github.com/topfox666" target="_blank"><i class="fa fa-github" aria-hidden="true"></i></a><a class="social-icon" href="https://weibo.com/u/3324382784" target="_blank"><i class="fa fa-weibo" aria-hidden="true"></i></a><a class="social-icon" href="mailto:[email protected]" target="_blank"><i class="fa fa-envelope" aria-hidden="true"></i></a></div></div></div><div class="card-widget card-announcement"><div class="card-content"><div class="item-headline"><i class="fa fa-bullhorn card-announcement-animation" aria-hidden="true"></i><span>Announcement</span></div><div class="announcement_content">工作联系:wechat cjQQQQQQ_,一起hello world</div></div></div><div class="card-widget card-recent-post"><div class="card-content"><div class="item-headline"><i class="fa fa-history" aria-hidden="true"></i><span>Recent Post</span></div><div class="aside-recent-item"> <div class="aside-recent-post"><a href="/2020/05/22/offer35-%E6%A0%88%E7%9A%84%E5%8E%8B%E5%85%A5%E5%BC%B9%E5%87%BA%E5%BA%8F%E5%88%97/"><div class="aside-post-cover"><img class="aside-post-bg lazyload" data-src="/img/logo.png" onerror="this.onerror=null;this.src='/img/404.jpg'" title="offer35-栈的压入弹出序列（模拟栈）" alt="offer35-栈的压入弹出序列（模拟栈）"></div><div class="aside-post-title"><div class="aside-post_title" href="/2020/05/22/offer35-%E6%A0%88%E7%9A%84%E5%8E%8B%E5%85%A5%E5%BC%B9%E5%87%BA%E5%BA%8F%E5%88%97/" title="offer35-栈的压入弹出序列（模拟栈）">offer35-栈的压入弹出序列（模拟栈）</div><time class="aside-post_meta post-meta__date">2020-05-22</time></div></a></div><div class="aside-recent-post"><a href="/2020/05/22/offer36-%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20III/"><div class="aside-post-cover"><img class="aside-post-bg lazyload" data-src="/img/logo.png" onerror="this.onerror=null;this.src='/img/404.jpg'" title="offer36-从上到下打印二叉树 III（双端队列）" alt="offer36-从上到下打印二叉树 III（双端队列）"></div><div class="aside-post-title"><div class="aside-post_title" href="/2020/05/22/offer36-%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91%20III/" title="offer36-从上到下打印二叉树 III（双端队列）">offer36-从上到下打印二叉树 III（双端队列）</div><time class="aside-post_meta post-meta__date">2020-05-22</time></div></a></div><div class="aside-recent-post"><a href="/2020/05/22/offer39-%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%A9%E6%B6%A6/"><div class="aside-post-cover"><img class="aside-post-bg lazyload" data-src="/img/logo.png" onerror="this.onerror=null;this.src='/img/404.jpg'" title="offer39-股票的最大利润（滑动窗口）" alt="offer39-股票的最大利润（滑动窗口）"></div><div class="aside-post-title"><div class="aside-post_title" href="/2020/05/22/offer39-%E8%82%A1%E7%A5%A8%E7%9A%84%E6%9C%80%E5%A4%A7%E5%88%A9%E6%B6%A6/" title="offer39-股票的最大利润（滑动窗口）">offer39-股票的最大利润（滑动窗口）</div><time class="aside-post_meta post-meta__date">2020-05-22</time></div></a></div><div class="aside-recent-post"><a href="/2020/05/22/offer40-%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91/"><div class="aside-post-cover"><img class="aside-post-bg lazyload" data-src="/img/logo.png" onerror="this.onerror=null;this.src='/img/404.jpg'" title="offer40-从上到下打印二叉树（层序遍历）" alt="offer40-从上到下打印二叉树（层序遍历）"></div><div class="aside-post-title"><div class="aside-post_title" href="/2020/05/22/offer40-%E4%BB%8E%E4%B8%8A%E5%88%B0%E4%B8%8B%E6%89%93%E5%8D%B0%E4%BA%8C%E5%8F%89%E6%A0%91/" title="offer40-从上到下打印二叉树（层序遍历）">offer40-从上到下打印二叉树（层序遍历）</div><time class="aside-post_meta post-meta__date">2020-05-22</time></div></a></div><div class="aside-recent-post"><a href="/2020/05/22/offer38-%E4%B8%91%E6%95%B0/"><div class="aside-post-cover"><img class="aside-post-bg lazyload" data-src="/img/logo.png" onerror="this.onerror=null;this.src='/img/404.jpg'" title="offer38-丑数（动态规划）" alt="offer38-丑数（动态规划）"></div><div class="aside-post-title"><div class="aside-post_title" href="/2020/05/22/offer38-%E4%B8%91%E6%95%B0/" title="offer38-丑数（动态规划）">offer38-丑数（动态规划）</div><time class="aside-post_meta post-meta__date">2020-05-22</time></div></a></div></div></div></div><div class="card-widget card-tags"><div class="card-content"><div class="item-headline"><i class="fa fa-tags" aria-hidden="true"></i><span>Tags</span></div><div class="card-tag-cloud"><a href="/tags/DP/" style="font-size: 17.78px; color: #999da1">DP</a> <a href="/tags/algorithm/" style="font-size: 24px; color: #99a9bf">algorithm</a> <a href="/tags/bfs/" style="font-size: 16px; color: #999">bfs</a> <a href="/tags/dfs/" style="font-size: 18.67px; color: #999ea6">dfs</a> <a href="/tags/essay/" style="font-size: 16.89px; color: #999b9d">essay</a> <a href="/tags/hashmap/" style="font-size: 16px; color: #999">hashmap</a> <a href="/tags/hashset/" style="font-size: 16px; color: #999">hashset</a> <a href="/tags/java/" style="font-size: 16.89px; color: #999b9d">java</a> <a href="/tags/language/" style="font-size: 17.78px; color: #999da1">language</a> <a href="/tags/leetcode/" style="font-size: 22.22px; color: #99a5b7">leetcode</a> <a href="/tags/leetcode%E5%8F%8C%E5%91%A8%E8%B5%9B/" style="font-size: 16px; color: #999">leetcode双周赛</a> <a href="/tags/leetcode%E5%91%A8%E8%B5%9B/" style="font-size: 19.56px; color: #99a0aa">leetcode周赛</a> <a href="/tags/markdown/" style="font-size: 16px; color: #999">markdown</a> <a href="/tags/set/" style="font-size: 16px; color: #999">set</a> <a href="/tags/%E4%BA%8C%E5%88%86/" style="font-size: 16px; color: #999">二分</a> <a href="/tags/%E4%BA%8C%E5%88%86%E5%BD%92%E5%B9%B6/" style="font-size: 16px; color: #999">二分归并</a> <a href="/tags/%E4%BA%8C%E5%88%86%E6%B3%95/" style="font-size: 18.67px; color: #999ea6">二分法</a> <a href="/tags/%E4%BD%8D%E8%BF%90%E7%AE%97/" style="font-size: 16.89px; color: #999b9d">位运算</a> <a href="/tags/%E5%88%86%E6%B2%BB/" style="font-size: 17.78px; color: #999da1">分治</a> <a href="/tags/%E5%89%91%E6%8C%87offer/" style="font-size: 23.11px; color: #99a7bb">剑指offer</a> <a href="/tags/%E5%8A%A8%E6%80%81%E8%A7%84%E5%88%92/" style="font-size: 20.44px; color: #99a2ae">动态规划</a> <a href="/tags/%E5%8A%A8%E8%A7%84/" style="font-size: 16.89px; color: #999b9d">动规</a> <a href="/tags/%E5%8D%95%E8%B0%83%E6%A0%88/" style="font-size: 16.89px; color: #999b9d">单调栈</a> <a href="/tags/%E5%8F%8C%E5%90%91%E9%93%BE%E8%A1%A8/" style="font-size: 16px; color: #999">双向链表</a> <a href="/tags/%E5%8F%8C%E5%90%91%E9%98%9F%E5%88%97/" style="font-size: 16px; color: #999">双向队列</a> <a href="/tags/%E5%8F%8C%E7%AB%AF%E9%98%9F%E5%88%97/" style="font-size: 16.89px; color: #999b9d">双端队列</a> <a href="/tags/%E5%93%88%E5%B8%8C/" style="font-size: 16px; color: #999">哈希</a> <a href="/tags/%E5%9B%9E%E6%BA%AF/" style="font-size: 16px; color: #999">回溯</a> <a href="/tags/%E5%A0%86/" style="font-size: 16px; color: #999">堆</a> <a href="/tags/%E5%A0%86%E6%8E%92%E5%BA%8F/" style="font-size: 16px; color: #999">堆排序</a> <a href="/tags/%E5%AD%97%E7%AC%A6%E4%B8%B2/" style="font-size: 18.67px; color: #999ea6">字符串</a> <a href="/tags/%E5%B1%82%E5%BA%8F%E9%81%8D%E5%8E%86/" style="font-size: 16px; color: #999">层序遍历</a> <a href="/tags/%E5%B9%B6%E6%9F%A5%E9%9B%86/" style="font-size: 16px; color: #999">并查集</a> <a href="/tags/%E6%95%B0/" style="font-size: 16.89px; color: #999b9d">数</a> <a href="/tags/%E6%95%B0%E5%AD%A6/" style="font-size: 21.33px; color: #99a4b2">数学</a> <a href="/tags/%E6%A0%88/" style="font-size: 16.89px; color: #999b9d">栈</a> <a href="/tags/%E6%A0%91/" style="font-size: 16.89px; color: #999b9d">树</a> <a href="/tags/%E6%BB%91%E5%8A%A8%E7%AA%97%E5%8F%A3/" style="font-size: 17.78px; color: #999da1">滑动窗口</a> <a href="/tags/%E8%B4%AA%E5%BF%83/" style="font-size: 17.78px; color: #999da1">贪心</a> <a href="/tags/%E9%80%92%E5%BD%92/" style="font-size: 19.56px; color: #99a0aa">递归</a> <a href="/tags/%E9%93%BE%E8%A1%A8/" style="font-size: 19.56px; color: #99a0aa">链表</a> <a href="/tags/%E9%98%9F%E5%88%97/" style="font-size: 16px; color: #999">队列</a></div></div></div><div class="card-widget card-archives"><div class="card-content"><div class="item-headline"><i class="fa fa-archive" aria-hidden="true"></i><span>Archives</span></div><ul class="archive-list"><li class="archive-list-item"><a class="archive-list-link" href="/archives/2020/05/"><span class="archive-list-date">2020年05月</span><span class="archive-list-count">80</span></a></li><li class="archive-list-item"><a class="archive-list-link" href="/archives/2020/04/"><span class="archive-list-date">2020年04月</span><span class="archive-list-count">1</span></a></li><li class="archive-list-item"><a class="archive-list-link" href="/archives/2020/03/"><span class="archive-list-date">2020年03月</span><span class="archive-list-count">1</span></a></li><li class="archive-list-item"><a class="archive-list-link" href="/archives/2019/02/"><span class="archive-list-date">2019年02月</span><span class="archive-list-count">3</span></a></li><li class="archive-list-item"><a class="archive-list-link" href="/archives/2014/07/"><span class="archive-list-date">2014年07月</span><span class="archive-list-count">2</span></a></li></ul></div></div><div class="card-widget card-webinfo"><div class="card-content"><div class="item-headline"><i class="fa fa-line-chart" aria-hidden="true"></i><span>Info</span></div><div class="webinfo"><div class="webinfo-item"><div class="webinfo-article-name">Article :</div><div class="webinfo-article-count">87</div></div><div class="webinfo-item"><div class="webinfo-runtime-name">Run time :</div><div class="webinfo-runtime-count" id="webinfo-runtime-count" start_date="6/7/2014 00:00:00"> </div></div><div class="webinfo-item"> <div class="webinfo-site-uv-name">UV :</div><div class="webinfo-site-uv-count" id="busuanzi_value_site_uv"></div></div><div class="webinfo-item"><div class="webinfo-site-name">PV :</div><div class="webinfo-site-pv-count" id="busuanzi_value_site_pv"></div></div></div></div></div></div></div></main><footer id="footer" style="background-image: url(https://cdn.jsdelivr.net/gh/jerryc127/[email protected]/top_img/index.jpg)" data-type="photo"><div id="footer-wrap"><div class="copyright">©2014 - 2020 By Fox Chen</div><div class="framework-info"><span>Driven </span><a href="http://hexo.io" target="_blank" rel="noopener"><span>Hexo</span></a><span class="footer-separator">|</span><span>Theme </span><a href="https://github.com/jerryc127/hexo-theme-butterfly" target="_blank" rel="noopener"><span>Butterfly</span></a></div><div class="footer_custom_text">welcome! Help Yourselves!</div></div></footer></div><section class="rightside" id="rightside"><div id="rightside-config-hide"><a class="translate_chn_to_cht" id="translateLink" href="javascript:translatePage();" title="Traditional Chinese and Simplified Chinese Conversion" target="_self">繁</a><i class="darkmode fa fa-sun-o" id="darkmode" title="Dark Mode"></i></div><div id="rightside-config-show"><div id="rightside_config" title="Setting"><i class="fa fa-cog" aria-hidden="true"></i></div><i class="fa fa-arrow-up" id="go-up" title="Back to top" aria-hidden="true"></i></div></section><script src="https://cdn.jsdelivr.net/npm/jquery@latest/dist/jquery.min.js"></script><script src="/js/utils.js"></script><script src="/js/main.js"></script><script src="/js/tw_cn.js"></script><script src="https://cdn.jsdelivr.net/npm/@fancyapps/fancybox@latest/dist/jquery.fancybox.min.js"></script><script id="canvas_nest" color="0,0,255" opacity="0.7" zIndex="-1" count="99" mobile="false" src="https://cdn.jsdelivr.net/gh/jerryc127/[email protected]/js/canvas-nest.js"></script><script async src="//busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js"></script><script src="https://cdn.jsdelivr.net/npm/instant.page@latest/instantpage.min.js" type="module"></script><script src="https://cdn.jsdelivr.net/npm/lazysizes@latest/lazysizes.min.js" async=""></script><script src="https://cdn.jsdelivr.net/gh/jerryc127/[email protected]/js/ClickShowText.js"></script><script src="https://cdn.jsdelivr.net/npm/typed.js"></script><script>var typed = new Typed(".subtitle", {
strings: 'while(fox.applyForJobs()){fox.offer++;},return SUCCESS;'.split(","),
startDelay: 300,
typeSpeed: 100,
loop: true,
backSpeed: 50
});</script></body></html>