118 lines
9.6 KiB
HTML
118 lines
9.6 KiB
HTML
<!DOCTYPE html><html lang="zh-CN"><head><meta charset="utf-8"><meta name="X-UA-Compatible" content="IE=edge"><title> MarkDown</title><meta name="description" content="A Blog Powered By Hexo"><meta name="viewport" content="width=device-width, initial-scale=1"><link rel="short icon" href="/favicon.png"><link rel="stylesheet" href="/css/apollo.css"><link rel="stylesheet" href="https://fonts.googleapis.com/css?family=Source+Sans+Pro:400,600" type="text/css"><style>mjx-container[jax="SVG"] {
|
|
direction: ltr;
|
|
}
|
|
|
|
mjx-container[jax="SVG"] > svg {
|
|
overflow: visible;
|
|
}
|
|
|
|
mjx-container[jax="SVG"] > svg a {
|
|
fill: blue;
|
|
stroke: blue;
|
|
}
|
|
|
|
mjx-container[jax="SVG"][display="true"] {
|
|
display: block;
|
|
text-align: center;
|
|
margin: 1em 0;
|
|
}
|
|
|
|
mjx-container[jax="SVG"][justify="left"] {
|
|
text-align: left;
|
|
}
|
|
|
|
mjx-container[jax="SVG"][justify="right"] {
|
|
text-align: right;
|
|
}
|
|
|
|
g[data-mml-node="merror"] > g {
|
|
fill: red;
|
|
stroke: red;
|
|
}
|
|
|
|
g[data-mml-node="merror"] > rect[data-background] {
|
|
fill: yellow;
|
|
stroke: none;
|
|
}
|
|
|
|
g[data-mml-node="mtable"] > line[data-line] {
|
|
stroke-width: 70px;
|
|
fill: none;
|
|
}
|
|
|
|
g[data-mml-node="mtable"] > rect[data-frame] {
|
|
stroke-width: 70px;
|
|
fill: none;
|
|
}
|
|
|
|
g[data-mml-node="mtable"] > .mjx-dashed {
|
|
stroke-dasharray: 140;
|
|
}
|
|
|
|
g[data-mml-node="mtable"] > .mjx-dotted {
|
|
stroke-linecap: round;
|
|
stroke-dasharray: 0,140;
|
|
}
|
|
|
|
g[data-mml-node="mtable"] > svg {
|
|
overflow: visible;
|
|
}
|
|
|
|
[jax="SVG"] mjx-tool {
|
|
display: inline-block;
|
|
position: relative;
|
|
width: 0;
|
|
height: 0;
|
|
}
|
|
|
|
[jax="SVG"] mjx-tool > mjx-tip {
|
|
position: absolute;
|
|
top: 0;
|
|
left: 0;
|
|
}
|
|
|
|
mjx-tool > mjx-tip {
|
|
display: inline-block;
|
|
padding: .2em;
|
|
border: 1px solid #888;
|
|
font-size: 70%;
|
|
background-color: #F8F8F8;
|
|
color: black;
|
|
box-shadow: 2px 2px 5px #AAAAAA;
|
|
}
|
|
|
|
g[data-mml-node="maction"][data-toggle] {
|
|
cursor: pointer;
|
|
}
|
|
|
|
mjx-status {
|
|
display: block;
|
|
position: fixed;
|
|
left: 1em;
|
|
bottom: 1em;
|
|
min-width: 25%;
|
|
padding: .2em .4em;
|
|
border: 1px solid #888;
|
|
font-size: 90%;
|
|
background-color: #F8F8F8;
|
|
color: black;
|
|
}
|
|
|
|
foreignObject[data-mjx-xml] {
|
|
font-family: initial;
|
|
line-height: normal;
|
|
overflow: visible;
|
|
}
|
|
|
|
.MathJax path {
|
|
stroke-width: 3;
|
|
}
|
|
|
|
mjx-container {
|
|
overflow: auto hidden;
|
|
}
|
|
|
|
mjx-container + br {
|
|
display: none;
|
|
}
|
|
</style></head><body><header><a href="/" class="logo-link"><img src="/logo.png"></a><ul class="nav nav-list"><li class="nav-list-item"><a href="/" target="_self" class="nav-list-link">ALL</a></li><li class="nav-list-item"><a href="/categories/leetcode/" target="_self" class="nav-list-link">LEETCODE</a></li><li class="nav-list-item"><a href="https://bearmiebear.blogspot.com" target="_blank" class="nav-list-link">BEAR</a></li><li class="nav-list-item"><a href="/atom.xml" target="_self" class="nav-list-link">RSS</a></li></ul></header><section class="container"><ul class="home post-list"><li class="post-list-item"><article class="post-block"><h2 class="post-title"><a href="/2020/04/01/leetcode-1160/" class="post-title-link">leetcode-1160</a></h2><div class="post-meta"><div class="post-time">2020年4月1日</div></div><div class="post-content"><h3 id="1160-__u62FC_u5199_u5355_u8BCD"><a href="#1160-__u62FC_u5199_u5355_u8BCD" class="headerlink" title="1160. 拼写单词"></a>1160. 拼写单词</h3><p><a href="https://leetcode-cn.com/problems/find-words-that-can-be-formed-by-characters/" target="_blank" rel="noopener">题目</a></p><a href="/2020/04/01/leetcode-1160/" class="read-more">...more</a></div></article></li><li class="post-list-item"><article class="post-block"><h2 class="post-title"><a href="/2020/03/30/leetcode-1071/" class="post-title-link">leetcode-1071</a></h2><div class="post-meta"><div class="post-time">2020年3月30日</div></div><div class="post-content"><h3 id="1071-__u5B57_u7B26_u4E32_u7684_u6700_u5927_u516C_u56E0_u5B50"><a href="#1071-__u5B57_u7B26_u4E32_u7684_u6700_u5927_u516C_u56E0_u5B50" class="headerlink" title="1071. 字符串的最大公因子"></a>1071. 字符串的最大公因子</h3><p><a href="https://leetcode-cn.com/problems/greatest-common-divisor-of-strings/" target="_blank" rel="noopener">题目</a></p><a href="/2020/03/30/leetcode-1071/" class="read-more">...more</a></div></article></li><li class="post-list-item"><article class="post-block"><h2 class="post-title"><a href="/2020/03/30/leetcode-999/" class="post-title-link">leetcode-999</a></h2><div class="post-meta"><div class="post-time">2020年3月30日</div></div><div class="post-content"><h3 id="999-__u53EF_u4EE5_u88AB_u4E00_u6B65_u6355_u83B7_u7684_u68CB_u5B50_u6570"><a href="#999-__u53EF_u4EE5_u88AB_u4E00_u6B65_u6355_u83B7_u7684_u68CB_u5B50_u6570" class="headerlink" title="999. 可以被一步捕获的棋子数"></a>999. 可以被一步捕获的棋子数</h3><p><a href="https://leetcode-cn.com/problems/available-captures-for-rook/" target="_blank" rel="noopener">题目</a></p><a href="/2020/03/30/leetcode-999/" class="read-more">...more</a></div></article></li><li class="post-list-item"><article class="post-block"><h2 class="post-title"><a href="/2020/03/29/leetcode-914/" class="post-title-link">leetcode-914</a></h2><div class="post-meta"><div class="post-time">2020年3月29日</div></div><div class="post-content"><h3 id="914-__u5361_u724C_u5206_u7EC4"><a href="#914-__u5361_u724C_u5206_u7EC4" class="headerlink" title="914. 卡牌分组"></a>914. 卡牌分组</h3><p><a href="https://leetcode-cn.com/problems/x-of-a-kind-in-a-deck-of-cards/" target="_blank" rel="noopener">题目</a></p><a href="/2020/03/29/leetcode-914/" class="read-more">...more</a></div></article></li><li class="post-list-item"><article class="post-block"><h2 class="post-title"><a href="/2020/03/29/leetcode-1013/" class="post-title-link">leetcode-1013</a></h2><div class="post-meta"><div class="post-time">2020年3月29日</div></div><div class="post-content"><h3 id="1013-__u5C06_u6570_u7EC4_u5206_u6210_u548C_u76F8_u7B49_u7684_u4E09_u4E2A_u90E8_u5206"><a href="#1013-__u5C06_u6570_u7EC4_u5206_u6210_u548C_u76F8_u7B49_u7684_u4E09_u4E2A_u90E8_u5206" class="headerlink" title="1013. 将数组分成和相等的三个部分"></a>1013. 将数组分成和相等的三个部分</h3><p><a href="https://leetcode-cn.com/problems/partition-array-into-three-parts-with-equal-sum/" target="_blank" rel="noopener">题目</a></p><a href="/2020/03/29/leetcode-1013/" class="read-more">...more</a></div></article></li><li class="post-list-item"><article class="post-block"><h2 class="post-title"><a href="/2020/03/26/leetcode-876/" class="post-title-link">leetcode-876</a></h2><div class="post-meta"><div class="post-time">2020年3月26日</div></div><div class="post-content"><h3 id="876-__u94FE_u8868_u7684_u4E2D_u95F4_u7ED3_u70B9"><a href="#876-__u94FE_u8868_u7684_u4E2D_u95F4_u7ED3_u70B9" class="headerlink" title="876. 链表的中间结点"></a>876. 链表的中间结点</h3><p><a href="https://leetcode-cn.com/problems/middle-of-the-linked-list/" target="_blank" rel="noopener">题目</a></p><a href="/2020/03/26/leetcode-876/" class="read-more">...more</a></div></article></li><li class="post-list-item"><article class="post-block"><h2 class="post-title"><a href="/2020/03/25/leetcode-836/" class="post-title-link">leetcode-836</a></h2><div class="post-meta"><div class="post-time">2020年3月25日</div></div><div class="post-content"><h3 id="836-__u77E9_u5F62_u91CD_u53E0"><a href="#836-__u77E9_u5F62_u91CD_u53E0" class="headerlink" title="836. 矩形重叠"></a>836. 矩形重叠</h3><p><a href="https://leetcode-cn.com/problems/rectangle-overlap/" target="_blank" rel="noopener">题目</a></p><a href="/2020/03/25/leetcode-836/" class="read-more">...more</a></div></article></li><li class="post-list-item"><article class="post-block"><h2 class="post-title"><a href="/2020/03/25/leetcode-409/" class="post-title-link">leetcode-409</a></h2><div class="post-meta"><div class="post-time">2020年3月25日</div></div><div class="post-content"><h3 id="409-__u6700_u957F_u56DE_u6587_u4E32"><a href="#409-__u6700_u957F_u56DE_u6587_u4E32" class="headerlink" title="409. 最长回文串"></a>409. 最长回文串</h3><p><a href="https://leetcode-cn.com/problems/longest-palindrome/" target="_blank" rel="noopener">题目</a></p><a href="/2020/03/25/leetcode-409/" class="read-more">...more</a></div></article></li><li class="post-list-item"><article class="post-block"><h2 class="post-title"><a href="/2020/03/25/leetcode-543/" class="post-title-link">leetcode-543</a></h2><div class="post-meta"><div class="post-time">2020年3月25日</div></div><div class="post-content"><h3 id="543-__u4E8C_u53C9_u6811_u7684_u76F4_u5F84"><a href="#543-__u4E8C_u53C9_u6811_u7684_u76F4_u5F84" class="headerlink" title="543. 二叉树的直径"></a>543. 二叉树的直径</h3><p><a href="https://leetcode-cn.com/problems/diameter-of-binary-tree/" target="_blank" rel="noopener">题目</a></p><a href="/2020/03/25/leetcode-543/" class="read-more">...more</a></div></article></li><li class="post-list-item"><article class="post-block"><h2 class="post-title"><a href="/2020/03/23/leetcode-225/" class="post-title-link">leetcode-225</a></h2><div class="post-meta"><div class="post-time">2020年3月23日</div></div><div class="post-content"><h3 id="225-__u7528_u961F_u5217_u5B9E_u73B0_u6808"><a href="#225-__u7528_u961F_u5217_u5B9E_u73B0_u6808" class="headerlink" title="225. 用队列实现栈"></a>225. 用队列实现栈</h3><p><a href="https://leetcode-cn.com/problems/implement-stack-using-queues/" target="_blank" rel="noopener">题目</a></p><a href="/2020/03/23/leetcode-225/" class="read-more">...more</a></div></article></li></ul></section><footer><div class="paginator"><a href="/archives/2020/" class="prev">PRVE</a><a href="/archives/2020/page/3/" class="next">NEXT</a></div></footer><script src="https://cdn.bootcss.com/mathjax/2.5.3/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script></body></html> |