﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-每一个你不满意的现在, 都有一个你没有努力的曾经.</title><link>http://www.cppblog.com/Wurq/</link><description>G-bits Wurq</description><language>zh-cn</language><lastBuildDate>Thu, 23 Apr 2026 10:07:41 GMT</lastBuildDate><pubDate>Thu, 23 Apr 2026 10:07:41 GMT</pubDate><ttl>60</ttl><item><title>【LeeCode 2017/09/18】189. Rotate Array </title><link>http://www.cppblog.com/Wurq/archive/2017/09/18/215255.html</link><dc:creator>Wurq</dc:creator><author>Wurq</author><pubDate>Mon, 18 Sep 2017 08:08:00 GMT</pubDate><guid>http://www.cppblog.com/Wurq/archive/2017/09/18/215255.html</guid><wfw:comment>http://www.cppblog.com/Wurq/comments/215255.html</wfw:comment><comments>http://www.cppblog.com/Wurq/archive/2017/09/18/215255.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Wurq/comments/commentRss/215255.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Wurq/services/trackbacks/215255.html</trackback:ping><description><![CDATA[<div>题目大意: 将数组向前循环移动k位。</div><br /><div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_160712" onclick="this.style.display='none'; Code_Closed_Text_160712.style.display='none'; Code_Open_Image_160712.style.display='inline'; Code_Open_Text_160712.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ContractedBlock.gif" width="11" height="16" align="top"><img id="Code_Open_Image_160712" style="display: none" onclick="this.style.display='none'; Code_Open_Text_160712.style.display='none'; Code_Closed_Image_160712.style.display='inline'; Code_Closed_Text_160712.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ExpandedBlockStart.gif" width="11" height="16" align="top"><span id="Code_Closed_Text_160712" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff">1.翻转数组</span><span id="Code_Open_Text_160712" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #0000FF; ">class</span><span style="color: #000000; ">&nbsp;Solution&nbsp;{<br /></span><span style="color: #0000FF; ">public</span><span style="color: #000000; ">:<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">void</span><span style="color: #000000; ">&nbsp;rotate(vector</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;&amp;</span><span style="color: #000000; ">&nbsp;nums,&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;k)&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;k&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;k&nbsp;</span><span style="color: #000000; ">%</span><span style="color: #000000; ">&nbsp;nums.size();<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">&nbsp;(k&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">;<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::reverse(nums.begin(),&nbsp;nums.end());<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::reverse(nums.begin(),&nbsp;nums.begin()&nbsp;</span><span style="color: #000000; ">+</span><span style="color: #000000; ">&nbsp;k);<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::reverse(nums.begin()</span><span style="color: #000000; ">+</span><span style="color: #000000; ">k,&nbsp;nums.end());<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br />};</span></span></div><br /><div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_160732" onclick="this.style.display='none'; Code_Closed_Text_160732.style.display='none'; Code_Open_Image_160732.style.display='inline'; Code_Open_Text_160732.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ContractedBlock.gif" width="11" height="16" align="top"><img id="Code_Open_Image_160732" style="display: none" onclick="this.style.display='none'; Code_Open_Text_160732.style.display='none'; Code_Closed_Image_160732.style.display='inline'; Code_Closed_Text_160732.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ExpandedBlockStart.gif" width="11" height="16" align="top"><span id="Code_Closed_Text_160732" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff">2.内存拷贝</span><span id="Code_Open_Text_160732" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #0000FF; ">class</span><span style="color: #000000; ">&nbsp;Solution&nbsp;{<br /></span><span style="color: #0000FF; ">public</span><span style="color: #000000; ">:<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">void</span><span style="color: #000000; ">&nbsp;rotate(vector</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;&amp;</span><span style="color: #000000; ">&nbsp;nums,&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;k)&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;k&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;k&nbsp;</span><span style="color: #000000; ">%</span><span style="color: #000000; ">&nbsp;nums.size();<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">&nbsp;(k&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">*</span><span style="color: #000000; ">&nbsp;ptr&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #0000FF; ">new</span><span style="color: #000000; ">&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">[nums.size()];<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::memcpy(ptr,&nbsp;nums.data()&nbsp;</span><span style="color: #000000; ">+</span><span style="color: #000000; ">(nums.size()</span><span style="color: #000000; ">-</span><span style="color: #000000; ">k),&nbsp;</span><span style="color: #0000FF; ">sizeof</span><span style="color: #000000; ">(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">)</span><span style="color: #000000; ">*</span><span style="color: #000000; ">k);<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::memcpy(ptr&nbsp;</span><span style="color: #000000; ">+</span><span style="color: #000000; ">&nbsp;k,&nbsp;nums.data(),&nbsp;</span><span style="color: #0000FF; ">sizeof</span><span style="color: #000000; ">(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">)</span><span style="color: #000000; ">*</span><span style="color: #000000; ">(nums.size()&nbsp;</span><span style="color: #000000; ">-</span><span style="color: #000000; ">&nbsp;k));<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;std::memcpy(nums.data(),&nbsp;ptr,&nbsp;</span><span style="color: #0000FF; ">sizeof</span><span style="color: #000000; ">(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">)</span><span style="color: #000000; ">*</span><span style="color: #000000; ">nums.size());<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;delete&nbsp;ptr;<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br />};</span></span></div><br /><div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_160804" onclick="this.style.display='none'; Code_Closed_Text_160804.style.display='none'; Code_Open_Image_160804.style.display='inline'; Code_Open_Text_160804.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ContractedBlock.gif" width="11" height="16" align="top"><img id="Code_Open_Image_160804" style="display: none" onclick="this.style.display='none'; Code_Open_Text_160804.style.display='none'; Code_Closed_Image_160804.style.display='inline'; Code_Closed_Text_160804.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ExpandedBlockStart.gif" width="11" height="16" align="top"><span id="Code_Closed_Text_160804" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff">3.循环遍历</span><span id="Code_Open_Text_160804" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #0000FF; ">class</span><span style="color: #000000; ">&nbsp;Solution&nbsp;{<br /></span><span style="color: #0000FF; ">public</span><span style="color: #000000; ">:<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">void</span><span style="color: #000000; ">&nbsp;rotate(vector</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;&amp;</span><span style="color: #000000; ">&nbsp;nums,&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;k)&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br />};<br /></span></span></div><br /><img src ="http://www.cppblog.com/Wurq/aggbug/215255.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Wurq/" target="_blank">Wurq</a> 2017-09-18 16:08 <a href="http://www.cppblog.com/Wurq/archive/2017/09/18/215255.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【LeeCode 2017/09/16】172. Factorial Trailing Zeroes </title><link>http://www.cppblog.com/Wurq/archive/2017/09/18/215252.html</link><dc:creator>Wurq</dc:creator><author>Wurq</author><pubDate>Mon, 18 Sep 2017 06:13:00 GMT</pubDate><guid>http://www.cppblog.com/Wurq/archive/2017/09/18/215252.html</guid><wfw:comment>http://www.cppblog.com/Wurq/comments/215252.html</wfw:comment><comments>http://www.cppblog.com/Wurq/archive/2017/09/18/215252.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Wurq/comments/commentRss/215252.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Wurq/services/trackbacks/215252.html</trackback:ping><description><![CDATA[<div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_141313" onclick="this.style.display='none'; Code_Closed_Text_141313.style.display='none'; Code_Open_Image_141313.style.display='inline'; Code_Open_Text_141313.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ContractedBlock.gif" width="11" height="16" align="top"><img id="Code_Open_Image_141313" style="display: none" onclick="this.style.display='none'; Code_Open_Text_141313.style.display='none'; Code_Closed_Image_141313.style.display='inline'; Code_Closed_Text_141313.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ExpandedBlockStart.gif" width="11" height="16" align="top"><span id="Code_Closed_Text_141313" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff"></span><span id="Code_Open_Text_141313" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;给定N，求解N!的末尾有多少个0</span><span style="color: #008000; "><br /></span><span style="color: #0000FF; ">class</span><span style="color: #000000; ">&nbsp;Solution&nbsp;<br />{<br /></span><span style="color: #0000FF; ">public</span><span style="color: #000000; ">:<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;trailingZeroes(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;n)&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;ret&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;n&nbsp;</span><span style="color: #000000; ">/</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">5</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;sum&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;ret;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">while</span><span style="color: #000000; ">&nbsp;(ret&nbsp;</span><span style="color: #000000; ">&gt;=</span><span style="color: #000000; ">5</span><span style="color: #000000; ">)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ret&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;ret&nbsp;</span><span style="color: #000000; ">/</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">5</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sum&nbsp;</span><span style="color: #000000; ">+=</span><span style="color: #000000; ">&nbsp;ret;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;sum;<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br />};</span></span></div><img src ="http://www.cppblog.com/Wurq/aggbug/215252.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Wurq/" target="_blank">Wurq</a> 2017-09-18 14:13 <a href="http://www.cppblog.com/Wurq/archive/2017/09/18/215252.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【LeeCode 2017/09/15】171. Excel Sheet Column Number</title><link>http://www.cppblog.com/Wurq/archive/2017/09/15/215247.html</link><dc:creator>Wurq</dc:creator><author>Wurq</author><pubDate>Fri, 15 Sep 2017 08:06:00 GMT</pubDate><guid>http://www.cppblog.com/Wurq/archive/2017/09/15/215247.html</guid><wfw:comment>http://www.cppblog.com/Wurq/comments/215247.html</wfw:comment><comments>http://www.cppblog.com/Wurq/archive/2017/09/15/215247.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Wurq/comments/commentRss/215247.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Wurq/services/trackbacks/215247.html</trackback:ping><description><![CDATA[<div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_160545" onclick="this.style.display='none'; Code_Closed_Text_160545.style.display='none'; Code_Open_Image_160545.style.display='inline'; Code_Open_Text_160545.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ContractedBlock.gif" width="11" height="16" align="top"><img id="Code_Open_Image_160545" style="display: none" onclick="this.style.display='none'; Code_Open_Text_160545.style.display='none'; Code_Closed_Image_160545.style.display='inline'; Code_Closed_Text_160545.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ExpandedBlockStart.gif" width="11" height="16" align="top"><span id="Code_Closed_Text_160545" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff"></span><span id="Code_Open_Text_160545" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #0000FF; ">class</span><span style="color: #000000; ">&nbsp;Solution&nbsp;{<br /></span><span style="color: #0000FF; ">public</span><span style="color: #000000; ">:<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;titleToNumber(</span><span style="color: #0000FF; ">string</span><span style="color: #000000; ">&nbsp;s)&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;ret&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;Sign&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">&nbsp;(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;i&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;s.length()</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">;&nbsp;i&nbsp;</span><span style="color: #000000; ">&gt;=</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;&nbsp;i</span><span style="color: #000000; ">--</span><span style="color: #000000; ">)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;num&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;s[i]</span><span style="color: #000000; ">-</span><span style="color: #000000; ">'</span><span style="color: #000000; ">A</span><span style="color: #000000; ">'</span><span style="color: #000000; ">+</span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ret&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;ret&nbsp;</span><span style="color: #000000; ">+</span><span style="color: #000000; ">&nbsp;num&nbsp;</span><span style="color: #000000; ">*</span><span style="color: #000000; ">&nbsp;Sign&nbsp;;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Sign&nbsp;</span><span style="color: #000000; ">*=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">26</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;ret;<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br />};</span></span></div><img src ="http://www.cppblog.com/Wurq/aggbug/215247.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Wurq/" target="_blank">Wurq</a> 2017-09-15 16:06 <a href="http://www.cppblog.com/Wurq/archive/2017/09/15/215247.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【LeeCode 2017/09/14】169. Majority Element </title><link>http://www.cppblog.com/Wurq/archive/2017/09/14/215241.html</link><dc:creator>Wurq</dc:creator><author>Wurq</author><pubDate>Thu, 14 Sep 2017 06:01:00 GMT</pubDate><guid>http://www.cppblog.com/Wurq/archive/2017/09/14/215241.html</guid><wfw:comment>http://www.cppblog.com/Wurq/comments/215241.html</wfw:comment><comments>http://www.cppblog.com/Wurq/archive/2017/09/14/215241.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Wurq/comments/commentRss/215241.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Wurq/services/trackbacks/215241.html</trackback:ping><description><![CDATA[<div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_140121" onclick="this.style.display='none'; Code_Closed_Text_140121.style.display='none'; Code_Open_Image_140121.style.display='inline'; Code_Open_Text_140121.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ContractedBlock.gif" width="11" height="16" align="top"><img id="Code_Open_Image_140121" style="display: none" onclick="this.style.display='none'; Code_Open_Text_140121.style.display='none'; Code_Closed_Image_140121.style.display='inline'; Code_Closed_Text_140121.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ExpandedBlockStart.gif" width="11" height="16" align="top"><span id="Code_Closed_Text_140121" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff"></span><span id="Code_Open_Text_140121" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #0000FF; ">class</span><span style="color: #000000; ">&nbsp;Solution&nbsp;{<br /></span><span style="color: #0000FF; ">public</span><span style="color: #000000; ">:<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;majorityElement(vector</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;&amp;</span><span style="color: #000000; ">&nbsp;nums)&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;count&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;nums.size();<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;map</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">,&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">m;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;i</span><span style="color: #000000; ">=</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;i</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">count;i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;m[nums[i]]</span><span style="color: #000000; ">++</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">&nbsp;(m[nums[i]]&nbsp;</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">&nbsp;count</span><span style="color: #000000; ">/</span><span style="color: #000000; ">2</span><span style="color: #000000; ">)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;nums[i];<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br />};</span></span></div><img src ="http://www.cppblog.com/Wurq/aggbug/215241.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Wurq/" target="_blank">Wurq</a> 2017-09-14 14:01 <a href="http://www.cppblog.com/Wurq/archive/2017/09/14/215241.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【LeeCode 2017/09/13】168. Excel Sheet Column Title </title><link>http://www.cppblog.com/Wurq/archive/2017/09/13/215240.html</link><dc:creator>Wurq</dc:creator><author>Wurq</author><pubDate>Wed, 13 Sep 2017 12:36:00 GMT</pubDate><guid>http://www.cppblog.com/Wurq/archive/2017/09/13/215240.html</guid><wfw:comment>http://www.cppblog.com/Wurq/comments/215240.html</wfw:comment><comments>http://www.cppblog.com/Wurq/archive/2017/09/13/215240.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Wurq/comments/commentRss/215240.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Wurq/services/trackbacks/215240.html</trackback:ping><description><![CDATA[<div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_203546" onclick="this.style.display='none'; Code_Closed_Text_203546.style.display='none'; Code_Open_Image_203546.style.display='inline'; Code_Open_Text_203546.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ContractedBlock.gif" width="11" height="16" align="top"><img id="Code_Open_Image_203546" style="display: none" onclick="this.style.display='none'; Code_Open_Text_203546.style.display='none'; Code_Closed_Image_203546.style.display='inline'; Code_Closed_Text_203546.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ExpandedBlockStart.gif" width="11" height="16" align="top"><span id="Code_Closed_Text_203546" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff">[算法详解/进制转换]</span><span id="Code_Open_Text_203546" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #0000FF; ">class</span><span style="color: #000000; ">&nbsp;Solution&nbsp;{<br /></span><span style="color: #0000FF; ">public</span><span style="color: #000000; ">:<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">string</span><span style="color: #000000; ">&nbsp;convertToTitle(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;n)&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">string</span><span style="color: #000000; ">&nbsp;ret&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">""</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">while</span><span style="color: #000000; ">&nbsp;(n)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ret&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;(</span><span style="color: #0000FF; ">char</span><span style="color: #000000; ">)((n&nbsp;</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">)&nbsp;</span><span style="color: #000000; ">%</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">26</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">+</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">'</span><span style="color: #000000; ">A</span><span style="color: #000000; ">'</span><span style="color: #000000; ">)&nbsp;</span><span style="color: #000000; ">+</span><span style="color: #000000; ">&nbsp;ret;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;n&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;(n&nbsp;</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">)&nbsp;</span><span style="color: #000000; ">/</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">26</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;ret;<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br />};</span></span></div><img src ="http://www.cppblog.com/Wurq/aggbug/215240.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Wurq/" target="_blank">Wurq</a> 2017-09-13 20:36 <a href="http://www.cppblog.com/Wurq/archive/2017/09/13/215240.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【LeeCode 2017/09/12】167. Two Sum II - Input array is sorted</title><link>http://www.cppblog.com/Wurq/archive/2017/09/12/215236.html</link><dc:creator>Wurq</dc:creator><author>Wurq</author><pubDate>Tue, 12 Sep 2017 12:43:00 GMT</pubDate><guid>http://www.cppblog.com/Wurq/archive/2017/09/12/215236.html</guid><wfw:comment>http://www.cppblog.com/Wurq/comments/215236.html</wfw:comment><comments>http://www.cppblog.com/Wurq/archive/2017/09/12/215236.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Wurq/comments/commentRss/215236.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Wurq/services/trackbacks/215236.html</trackback:ping><description><![CDATA[<div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_204227" onclick="this.style.display='none'; Code_Closed_Text_204227.style.display='none'; Code_Open_Image_204227.style.display='inline'; Code_Open_Text_204227.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ContractedBlock.gif" width="11" height="16" align="top"><img id="Code_Open_Image_204227" style="display: none" onclick="this.style.display='none'; Code_Open_Text_204227.style.display='none'; Code_Closed_Image_204227.style.display='inline'; Code_Closed_Text_204227.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ExpandedBlockStart.gif" width="11" height="16" align="top"><span id="Code_Closed_Text_204227" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff"></span><span id="Code_Open_Text_204227" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;尺取法</span><span style="color: #008000; "><br /></span><span style="color: #0000FF; ">class</span><span style="color: #000000; ">&nbsp;Solution&nbsp;{<br /></span><span style="color: #0000FF; ">public</span><span style="color: #000000; ">:<br />&nbsp;&nbsp;&nbsp;&nbsp;vector</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">&nbsp;twoSum(vector</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;&amp;</span><span style="color: #000000; ">&nbsp;numbers,&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;target)&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;vector</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">&nbsp;ret&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;vector</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">();<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;start&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;end&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;numbers.size()</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">while</span><span style="color: #000000; ">(start&nbsp;</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">&nbsp;end)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">&nbsp;(numbers[start]&nbsp;</span><span style="color: #000000; ">+</span><span style="color: #000000; ">&nbsp;numbers[end]&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;target)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ret.push_back(start&nbsp;</span><span style="color: #000000; ">+</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">1</span><span style="color: #000000; ">);<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ret.push_back(end&nbsp;</span><span style="color: #000000; ">+</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">1</span><span style="color: #000000; ">);<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">break</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">else</span><span style="color: #000000; ">&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">&nbsp;(numbers[start]&nbsp;</span><span style="color: #000000; ">+</span><span style="color: #000000; ">&nbsp;numbers[end]&nbsp;</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">&nbsp;target)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;start</span><span style="color: #000000; ">++</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;end</span><span style="color: #000000; ">--</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;ret;<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br />};</span></span></div><img src ="http://www.cppblog.com/Wurq/aggbug/215236.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Wurq/" target="_blank">Wurq</a> 2017-09-12 20:43 <a href="http://www.cppblog.com/Wurq/archive/2017/09/12/215236.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【LeeCode 2017/09/11】160. Intersection of Two Linked Lists </title><link>http://www.cppblog.com/Wurq/archive/2017/09/12/215235.html</link><dc:creator>Wurq</dc:creator><author>Wurq</author><pubDate>Tue, 12 Sep 2017 06:38:00 GMT</pubDate><guid>http://www.cppblog.com/Wurq/archive/2017/09/12/215235.html</guid><wfw:comment>http://www.cppblog.com/Wurq/comments/215235.html</wfw:comment><comments>http://www.cppblog.com/Wurq/archive/2017/09/12/215235.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Wurq/comments/commentRss/215235.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Wurq/services/trackbacks/215235.html</trackback:ping><description><![CDATA[<div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_143742" onclick="this.style.display='none'; Code_Closed_Text_143742.style.display='none'; Code_Open_Image_143742.style.display='inline'; Code_Open_Text_143742.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ContractedBlock.gif" width="11" height="16" align="top"><img id="Code_Open_Image_143742" style="display: none" onclick="this.style.display='none'; Code_Open_Text_143742.style.display='none'; Code_Closed_Image_143742.style.display='inline'; Code_Closed_Text_143742.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ExpandedBlockStart.gif" width="11" height="16" align="top"><span id="Code_Closed_Text_143742" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff"></span><span id="Code_Open_Text_143742" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;题目大意:&nbsp;寻找两个单向链表的最初的相交点，并且这两个单向链表不会构成的环。<br /></span><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;而我对链表的环的理解是&nbsp;:&nbsp;按顺序拼接而成的同向环。<br /></span><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;题目要求在时间复杂度为O(n),空间复杂度为O(1)的情况下完成，而且这还只是Easy题<img src="http://www.cppblog.com/Images/dot.gif"  alt="" /><br /></span><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;我就纳闷了，这样的情况有什么神奇的思路可以实现？<br /></span><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;苦思冥想没想到合适的解法，去网上找大神题解才明白，环是指构成圈圈即可，无关方向Orz<img src="http://www.cppblog.com/Images/dot.gif"  alt="" /><br /></span><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;不明白的一点就是，为什么末尾一定会重合？，不存在中间子链表的情况吗?<br /></span><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;这样问题就容易解决的多了，也就是说最初的交点将会导致后续的节点全部重合。&nbsp;</span><span style="color: #008000; "><br /></span><span style="color: #0000FF; ">class</span><span style="color: #000000; ">&nbsp;Solution&nbsp;{<br /></span><span style="color: #0000FF; ">public</span><span style="color: #000000; ">:<br />&nbsp;&nbsp;&nbsp;&nbsp;ListNode&nbsp;</span><span style="color: #000000; ">*</span><span style="color: #000000; ">getIntersectionNode(ListNode&nbsp;</span><span style="color: #000000; ">*</span><span style="color: #000000; ">headA,&nbsp;ListNode&nbsp;</span><span style="color: #000000; ">*</span><span style="color: #000000; ">headB)&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">&nbsp;(headA&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;nullptr&nbsp;</span><span style="color: #000000; ">&amp;&amp;</span><span style="color: #000000; ">&nbsp;headB&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;nullptr)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;nullptr;<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;lenA&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;lenB&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ListNode</span><span style="color: #000000; ">*</span><span style="color: #000000; ">&nbsp;a&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;headA;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ListNode</span><span style="color: #000000; ">*</span><span style="color: #000000; ">&nbsp;b&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;headB;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">while</span><span style="color: #000000; ">&nbsp;(a&nbsp;</span><span style="color: #000000; ">!=</span><span style="color: #000000; ">&nbsp;nullptr)&nbsp;{a&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;a</span><span style="color: #000000; ">-&gt;</span><span style="color: #000000; ">next;lenA</span><span style="color: #000000; ">++</span><span style="color: #000000; ">;}<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">while</span><span style="color: #000000; ">&nbsp;(b&nbsp;</span><span style="color: #000000; ">!=</span><span style="color: #000000; ">&nbsp;nullptr)&nbsp;{b&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;b</span><span style="color: #000000; ">-&gt;</span><span style="color: #000000; ">next;lenB</span><span style="color: #000000; ">++</span><span style="color: #000000; ">;}<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(lenA&nbsp;</span><span style="color: #000000; ">&lt;=</span><span style="color: #000000; ">&nbsp;lenB){&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;a&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;headA;b&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;headB;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">while</span><span style="color: #000000; ">&nbsp;(lenB&nbsp;</span><span style="color: #000000; ">-</span><span style="color: #000000; ">&nbsp;lenA&nbsp;</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">){lenB</span><span style="color: #000000; ">--</span><span style="color: #000000; ">;b&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;b</span><span style="color: #000000; ">-&gt;</span><span style="color: #000000; ">next;}<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}</span><span style="color: #0000FF; ">else</span><span style="color: #000000; ">{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;a&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;headB;b&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;headA;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">while</span><span style="color: #000000; ">&nbsp;(lenA&nbsp;</span><span style="color: #000000; ">-</span><span style="color: #000000; ">&nbsp;lenB&nbsp;</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">){lenA</span><span style="color: #000000; ">--</span><span style="color: #000000; ">;b&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;b</span><span style="color: #000000; ">-&gt;</span><span style="color: #000000; ">next;}<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">while</span><span style="color: #000000; ">&nbsp;(a</span><span style="color: #000000; ">!=</span><span style="color: #000000; ">nullptr&nbsp;</span><span style="color: #000000; ">&amp;&amp;</span><span style="color: #000000; ">&nbsp;b</span><span style="color: #000000; ">!=</span><span style="color: #000000; ">nullptr)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">&nbsp;(a</span><span style="color: #000000; ">-&gt;</span><span style="color: #000000; ">val&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;b</span><span style="color: #000000; ">-&gt;</span><span style="color: #000000; ">val)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;a;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;a&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;a</span><span style="color: #000000; ">-&gt;</span><span style="color: #000000; ">next;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;b&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;b</span><span style="color: #000000; ">-&gt;</span><span style="color: #000000; ">next;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;nullptr;<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br />};</span></span></div><img src ="http://www.cppblog.com/Wurq/aggbug/215235.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Wurq/" target="_blank">Wurq</a> 2017-09-12 14:38 <a href="http://www.cppblog.com/Wurq/archive/2017/09/12/215235.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【LeeCode 2017/09/09】155. Min Stack </title><link>http://www.cppblog.com/Wurq/archive/2017/09/09/215233.html</link><dc:creator>Wurq</dc:creator><author>Wurq</author><pubDate>Sat, 09 Sep 2017 08:33:00 GMT</pubDate><guid>http://www.cppblog.com/Wurq/archive/2017/09/09/215233.html</guid><wfw:comment>http://www.cppblog.com/Wurq/comments/215233.html</wfw:comment><comments>http://www.cppblog.com/Wurq/archive/2017/09/09/215233.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Wurq/comments/commentRss/215233.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Wurq/services/trackbacks/215233.html</trackback:ping><description><![CDATA[<br /><div style="background-color: #eeeeee; font-size: 13px; border: 1px solid #cccccc; padding: 4px 5px 4px 4px; width: 98%; word-break: break-all;"><img id="Code_Closed_Image_163219" onclick="this.style.display='none'; Code_Closed_Text_163219.style.display='none'; Code_Open_Image_163219.style.display='inline'; Code_Open_Text_163219.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ContractedBlock.gif" width="11" height="16" align="top"><img id="Code_Open_Image_163219" style="display: none" onclick="this.style.display='none'; Code_Open_Text_163219.style.display='none'; Code_Closed_Image_163219.style.display='inline'; Code_Closed_Text_163219.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ExpandedBlockStart.gif" width="11" height="16" align="top"><span id="Code_Closed_Text_163219" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff">两个stack</span><span id="Code_Open_Text_163219" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;最小栈<br /></span><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;两个stack</span><span style="color: #008000; "><br /></span><span style="color: #0000FF; ">class</span><span style="color: #000000; ">&nbsp;MinStack&nbsp;{<br /></span><span style="color: #0000FF; ">public</span><span style="color: #000000; ">:<br />&nbsp;&nbsp;&nbsp;&nbsp;stack</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">allStack;<br />&nbsp;&nbsp;&nbsp;&nbsp;stack</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">minStack;<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;MinStack()&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;allStack&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;stack</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">();<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;minStack&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;stack</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">();<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">void</span><span style="color: #000000; ">&nbsp;push(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;x)&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">&nbsp;(minStack.empty()&nbsp;</span><span style="color: #000000; ">||</span><span style="color: #000000; ">&nbsp;x&nbsp;</span><span style="color: #000000; ">&lt;=</span><span style="color: #000000; ">&nbsp;minStack.top())<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;minStack.push(x);<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;allStack.push(x);<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">void</span><span style="color: #000000; ">&nbsp;pop()&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;topNum&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;allStack.top();<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">&nbsp;(topNum&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;minStack.top())<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;minStack.pop();<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;allStack.pop();<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;top()&nbsp;{</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;allStack.top();}<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;getMin()&nbsp;{</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;minStack.top();}<br />};</span></span></div><div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_162824" onclick="this.style.display='none'; Code_Closed_Text_162824.style.display='none'; Code_Open_Image_162824.style.display='inline'; Code_Open_Text_162824.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ContractedBlock.gif" width="11" height="16" align="top"><img id="Code_Open_Image_162824" style="display: none" onclick="this.style.display='none'; Code_Open_Text_162824.style.display='none'; Code_Closed_Image_162824.style.display='inline'; Code_Closed_Text_162824.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ExpandedBlockStart.gif" width="11" height="16" align="top"><span id="Code_Closed_Text_162824" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff">数组模拟最小栈</span><span id="Code_Open_Text_162824" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #0000FF; ">class</span><span style="color: #000000; ">&nbsp;MinStack&nbsp;{<br /></span><span style="color: #0000FF; ">public</span><span style="color: #000000; ">:<br />&nbsp;&nbsp;&nbsp;&nbsp;stack</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">allStack;<br />&nbsp;&nbsp;&nbsp;&nbsp;vector</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">minNum;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;记录当前栈位置最小的值</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;index&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;MinStack()&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;allStack&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;stack</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">();<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;minNum&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;vector</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">();<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;index&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">void</span><span style="color: #000000; ">&nbsp;Add_Stack(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;x)<br />&nbsp;&nbsp;&nbsp;&nbsp;{&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">&nbsp;(</span><span style="color: #000000; ">0</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">&lt;=</span><span style="color: #000000; ">&nbsp;index</span><span style="color: #000000; ">+</span><span style="color: #000000; ">1</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">&amp;&amp;</span><span style="color: #000000; ">&nbsp;index</span><span style="color: #000000; ">+</span><span style="color: #000000; ">1</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">&nbsp;minNum.size())<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;minNum[index</span><span style="color: #000000; ">+</span><span style="color: #000000; ">1</span><span style="color: #000000; ">]&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;x;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;minNum.push_back(x);<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">void</span><span style="color: #000000; ">&nbsp;push(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;x)&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">&nbsp;(index&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">||</span><span style="color: #000000; ">&nbsp;x&nbsp;</span><span style="color: #000000; ">&lt;=</span><span style="color: #000000; ">&nbsp;minNum[index])<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Add_Stack(x);<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;index</span><span style="color: #000000; ">++</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;allStack.push(x);<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">void</span><span style="color: #000000; ">&nbsp;pop()&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;topNum&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;allStack.top();<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;allStack.pop();<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">&nbsp;(topNum&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;minNum[index])<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;index</span><span style="color: #000000; ">--</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;top()&nbsp;{</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;allStack.top();}<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;getMin()&nbsp;{</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;minNum[index];}<br />};</span></span></div><br /><br /><br /><br /><img src ="http://www.cppblog.com/Wurq/aggbug/215233.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Wurq/" target="_blank">Wurq</a> 2017-09-09 16:33 <a href="http://www.cppblog.com/Wurq/archive/2017/09/09/215233.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【LeeCode 2017/09/08】122. Best Time to Buy and Sell Stock II </title><link>http://www.cppblog.com/Wurq/archive/2017/09/08/215232.html</link><dc:creator>Wurq</dc:creator><author>Wurq</author><pubDate>Fri, 08 Sep 2017 07:59:00 GMT</pubDate><guid>http://www.cppblog.com/Wurq/archive/2017/09/08/215232.html</guid><wfw:comment>http://www.cppblog.com/Wurq/comments/215232.html</wfw:comment><comments>http://www.cppblog.com/Wurq/archive/2017/09/08/215232.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Wurq/comments/commentRss/215232.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Wurq/services/trackbacks/215232.html</trackback:ping><description><![CDATA[<div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_155857" onclick="this.style.display='none'; Code_Closed_Text_155857.style.display='none'; Code_Open_Image_155857.style.display='inline'; Code_Open_Text_155857.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ContractedBlock.gif" width="11" height="16" align="top"><img id="Code_Open_Image_155857" style="display: none" onclick="this.style.display='none'; Code_Open_Text_155857.style.display='none'; Code_Closed_Image_155857.style.display='inline'; Code_Closed_Text_155857.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ExpandedBlockStart.gif" width="11" height="16" align="top"><span id="Code_Closed_Text_155857" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff"></span><span id="Code_Open_Text_155857" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #0000FF; ">class</span><span style="color: #000000; ">&nbsp;Solution&nbsp;{<br /></span><span style="color: #0000FF; ">public</span><span style="color: #000000; ">:<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;maxProfit(vector</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;&amp;</span><span style="color: #000000; ">&nbsp;prices)&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;sum&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">&nbsp;(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;i&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;&nbsp;i&nbsp;</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">&nbsp;prices.size();&nbsp;i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">&nbsp;(i&nbsp;</span><span style="color: #000000; ">+</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">1</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">&gt;=</span><span style="color: #000000; ">&nbsp;prices.size()&nbsp;</span><span style="color: #000000; ">||</span><span style="color: #000000; ">&nbsp;prices[i]&nbsp;</span><span style="color: #000000; ">&gt;=</span><span style="color: #000000; ">&nbsp;prices[i&nbsp;</span><span style="color: #000000; ">+</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">1</span><span style="color: #000000; ">])<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">continue</span><span style="color: #000000; ">;<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;j&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;i&nbsp;</span><span style="color: #000000; ">+</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">&nbsp;(j&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;i</span><span style="color: #000000; ">+</span><span style="color: #000000; ">1</span><span style="color: #000000; ">;&nbsp;j&nbsp;</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">&nbsp;prices.size();&nbsp;j</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">&nbsp;(prices[j]&nbsp;</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">&nbsp;prices[j&nbsp;</span><span style="color: #000000; ">-</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">1</span><span style="color: #000000; ">])<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">break</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;sum&nbsp;</span><span style="color: #000000; ">+=</span><span style="color: #000000; ">&nbsp;prices[</span><span style="color: #000000; ">--</span><span style="color: #000000; ">j]&nbsp;</span><span style="color: #000000; ">-</span><span style="color: #000000; ">&nbsp;prices[i];<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;i&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;j;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;sum;<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br />};</span></span></div><img src ="http://www.cppblog.com/Wurq/aggbug/215232.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Wurq/" target="_blank">Wurq</a> 2017-09-08 15:59 <a href="http://www.cppblog.com/Wurq/archive/2017/09/08/215232.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【LeeCode 2017/09/07】141. Linked List Cycle </title><link>http://www.cppblog.com/Wurq/archive/2017/09/08/215231.html</link><dc:creator>Wurq</dc:creator><author>Wurq</author><pubDate>Fri, 08 Sep 2017 07:39:00 GMT</pubDate><guid>http://www.cppblog.com/Wurq/archive/2017/09/08/215231.html</guid><wfw:comment>http://www.cppblog.com/Wurq/comments/215231.html</wfw:comment><comments>http://www.cppblog.com/Wurq/archive/2017/09/08/215231.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/Wurq/comments/commentRss/215231.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/Wurq/services/trackbacks/215231.html</trackback:ping><description><![CDATA[<div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_153907" onclick="this.style.display='none'; Code_Closed_Text_153907.style.display='none'; Code_Open_Image_153907.style.display='inline'; Code_Open_Text_153907.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ContractedBlock.gif" width="11" height="16" align="top"><img id="Code_Open_Image_153907" style="display: none" onclick="this.style.display='none'; Code_Open_Text_153907.style.display='none'; Code_Closed_Image_153907.style.display='inline'; Code_Closed_Text_153907.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ExpandedBlockStart.gif" width="11" height="16" align="top"><span id="Code_Closed_Text_153907" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff"></span><span id="Code_Open_Text_153907" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;给定一条链表，判断该链表中是否存在环<br /></span><span style="color: #008000; ">//</span><span style="color: #008000; ">&nbsp;创建两天速率不同(互质)的链表指针，如果这两指针能够重合则说明存在环。</span><span style="color: #008000; "><br /></span><span style="color: #0000FF; ">class</span><span style="color: #000000; ">&nbsp;Solution&nbsp;<br />{<br /></span><span style="color: #0000FF; ">public</span><span style="color: #000000; ">:<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">bool</span><span style="color: #000000; ">&nbsp;hasCycle(ListNode&nbsp;</span><span style="color: #000000; ">*</span><span style="color: #000000; ">head)&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ListNode</span><span style="color: #000000; ">*</span><span style="color: #000000; ">&nbsp;fast&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;head;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ListNode</span><span style="color: #000000; ">*</span><span style="color: #000000; ">&nbsp;slow&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;head;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">while</span><span style="color: #000000; ">&nbsp;(fast&nbsp;</span><span style="color: #000000; ">!=</span><span style="color: #000000; ">&nbsp;nullptr&nbsp;</span><span style="color: #000000; ">&amp;&amp;</span><span style="color: #000000; ">&nbsp;slow&nbsp;</span><span style="color: #000000; ">!=</span><span style="color: #000000; ">&nbsp;nullptr)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;fast&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;fast</span><span style="color: #000000; ">-&gt;</span><span style="color: #000000; ">next;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">&nbsp;(slow</span><span style="color: #000000; ">-&gt;</span><span style="color: #000000; ">next&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;nullptr)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;slow&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;nullptr;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;slow&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;slow</span><span style="color: #000000; ">-&gt;</span><span style="color: #000000; ">next</span><span style="color: #000000; ">-&gt;</span><span style="color: #000000; ">next;<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">&nbsp;(fast&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;nullptr&nbsp;</span><span style="color: #000000; ">||</span><span style="color: #000000; ">&nbsp;slow&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;nullptr)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">break</span><span style="color: #000000; ">;<br /><br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">&nbsp;(fast</span><span style="color: #000000; ">-&gt;</span><span style="color: #000000; ">val&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;slow</span><span style="color: #000000; ">-&gt;</span><span style="color: #000000; ">val)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;</span><span style="color: #0000FF; ">true</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;</span><span style="color: #0000FF; ">false</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br />};</span></span></div><img src ="http://www.cppblog.com/Wurq/aggbug/215231.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/Wurq/" target="_blank">Wurq</a> 2017-09-08 15:39 <a href="http://www.cppblog.com/Wurq/archive/2017/09/08/215231.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>