123 lines
6.8 KiB
HTML
123 lines
6.8 KiB
HTML
<!DOCTYPE html><html lang="zh-CN"><head><meta charset="utf-8"><meta name="X-UA-Compatible" content="IE=edge"><title> leetcode-409 · MarkDown</title><meta name="description" content="leetcode-409 - Ching"><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><!-- hexo-inject:begin --><!-- hexo-inject:end -->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><!-- hexo-inject:begin --><!-- hexo-inject:end --></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"><div class="post"><article class="post-block"><h1 class="post-title">leetcode-409</h1><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>
|
|
<!-- hexo-inject:begin --><!-- hexo-inject:end --><a id="more"></a>
|
|
<p>一开始理解错题目了，以为是寻找字符串中的最长回文串，结果是构造。但是原理基本一样，由于回文中心对称，所以是由多个偶数个相同字母和至多一个奇数个相同字母组成。</p>
|
|
<p>这样只要数给出的字符串中有几个偶数个相同字母和几个奇数个相同字母就可以了。奇数个相同字母可以减少一个当偶数个用，最后再加回去一个。</p>
|
|
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br></pre></td><td class="code"><pre><span class="line"><span class="class"><span class="keyword">class</span> <span class="title">Solution</span>:</span></span><br><span class="line"> <span class="function"><span class="keyword">def</span> <span class="title">longestPalindrome</span><span class="params">(self, s: str)</span> -> int:</span></span><br><span class="line"> d = {}</span><br><span class="line"> <span class="keyword">for</span> l <span class="keyword">in</span> s:</span><br><span class="line"> <span class="keyword">if</span> <span class="keyword">not</span> l <span class="keyword">in</span> d:</span><br><span class="line"> d[l] = <span class="number">0</span></span><br><span class="line"> d[l] += <span class="number">1</span></span><br><span class="line"></span><br><span class="line"> i = <span class="number">0</span></span><br><span class="line"> odd = <span class="keyword">False</span></span><br><span class="line"> <span class="keyword">for</span> k, v <span class="keyword">in</span> d.items():</span><br><span class="line"> <span class="keyword">if</span> v % <span class="number">2</span>:</span><br><span class="line"> i += (v<span class="number">-1</span>)</span><br><span class="line"> odd = <span class="keyword">True</span></span><br><span class="line"> <span class="keyword">else</span>:</span><br><span class="line"> i += v</span><br><span class="line"> <span class="keyword">if</span> odd:</span><br><span class="line"> i += <span class="number">1</span></span><br><span class="line"> <span class="keyword">return</span> i</span><br><span class="line"></span><br><span class="line"><span class="comment">#40 ms 13.6 MB</span></span><br></pre></td></tr></table></figure>
|
|
</div></article></div></section><footer><div class="paginator"><a href="/2020/03/25/leetcode-836/" class="prev">PRVE</a><a href="/2020/03/25/leetcode-543/" class="next">NEXT</a></div><div class="copyright"><p>© 2016 - 2020 <a href="http://blog.tunpok.com">Ching</a>, unless otherwise noted.</p></div></footer><script src="https://cdn.bootcss.com/mathjax/2.5.3/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script><!-- hexo-inject:begin --><!-- hexo-inject:end --></body></html> |