<main>
<article>
<h1 class="csdn_top">整数划分问题的递归算法-c语言</h1>
<div class="article_bar clearfix">
<div class="artical_tag">
<span class="original">
转载 </span>
<span class="time">2014年01月03日 18:46:58</span>
</div>
<ul class="article_tags clearfix csdn-tracking-statistics tracking-click" data-mod="popu_377" style="display: none;">
<li class="tit">标签：</li>
<!-- [startarticletags]-->
<!-- [endarticletags]-->
</ul>
<ul class="right_bar">
<li><button class="btn-noborder"><i class="icon iconfont icon-read"></i><span class="txt">1976</span></button></li>
<li class="edit" style="display: none;">
<a class="btn-noborder" href="http://mp.blog.csdn.net/postedit/17797151">
<i class="icon iconfont icon-bianji"></i><span class="txt">编辑</span>
</a>
</li>
<li class="del" style="display: none;">
<a class="btn-noborder" οnclick="javascript:deleteArticle(fileName);return false;">
<i class="icon iconfont icon-shanchu"></i><span class="txt">删除</span>
</a>
</li>
</ul>
</div>
<div id="article_content" class="article_content csdn-tracking-statistics tracking-click" data-mod="popu_519" data-dsm="post" style="overflow: hidden;">
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
整数划分问题是算法中的一个经典命题之一，有关这个问题的讲述在讲解到递归时基本都将涉及。所谓整数划分，是指把一个正整数n写成如下形式：</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
n=m1+m2+...+mi; （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m);</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
例如但n=4时，他有5个划分，{4},{3,1},{2,2},{2,1,1},{1,1,1,1};</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
注意4=1+3 和 4=3+1被认为是同一个划分。</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
该问题是求出n的所有划分个数，即f(n, n)。下面我们考虑求f(n,m)的方法;</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
<span style="line-height:19px;"><span style="line-height:1.8;color:#FF0000;">---------------------------------------------------------------------</span></span></p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
<span style="line-height:19px;"><span style="line-height:1.8;color:#FF0000;"> （一）递归法</span></span></p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
<span style="line-height:19px;"><span style="line-height:1.8;color:#FF0000;"> <span style="line-height:19px;"><span style="line-height:1.8;">---------------------------------------------------------------------</span></span></span></span></p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
根据n和m的关系，考虑以下几种情况： </p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
（1）当n=1时，不论m的值为多少（m>0)，只有一种划分即{1};</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
(2) 当m=1时，不论n的值为多少，只有一种划分即n个1，{1,1,1,...,1};</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
(3) 当n=m时，根据划分中是否包含n，可以分为两种情况：</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
(a). 划分中包含n的情况，只有一个即{n}；</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
(b). 划分中不包含n的情况，这时划分中最大的数字也一定比n小，即n的所有(n-1)划分。</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
因此 f(n,n) =1 + f(n,n-1);</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
(4) 当n<m时，由于划分中不可能出现负数，因此就相当于f(n,n);</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
(5) 但n>m时，根据划分中是否包含最大值m，可以分为两种情况：</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
(a). 划分中包含m的情况，即{m, {x1,x2,...xi}}, 其中{x1,x2,... xi} 的和为n-m，可能再次出现m，因此是（n-m）的m划分，因此这种划分</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
个数为f(n-m, m);</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
(b). 划分中不包含m的情况，则划分中所有值都比m小，即n的(m-1)划分，个数为f(n,m-1);</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
因此 f(n, m) = f(n-m, m)+f(n,m-1);</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
综合以上情况，我们可以看出，上面的结论具有递归定义特征，其中（1）和（2）属于回归条件，（3）和（4）属于特殊情况，将会转换为情况（5）。而情况（5）为通用情况，属于递推的方法，其本质主要是通过减小m以达到回归条件，从而解决问题。其递推表达式如下：</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
f(n, m)= 1; (n=1 or m=1)</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
f(n, n); (n<m)</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
1+ f(n, m-1); (n=m)</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
f(n-m,m)+f(n,m-1); (n>m)</p>
<p style="margin:10px auto;font-family:Verdana, Arial, Helvetica, sans-serif;font-size:13px;line-height:23px;background-color:rgb(245,245,245);">
</p><div class="dp-highlighter bg_cpp"><div class="bar"><div class="tools"><b>[cpp]</b> <a href="#" class="ViewSource" title="view plain" οnclick="dp.sh.Toolbar.Command('ViewSource',this);return false;">view plain</a><span class="tracking-ad" data-mod="popu_168"> <a href="#" class="CopyToClipboard" title="copy" οnclick="dp.sh.Toolbar.Command('CopyToClipboard',this);return false;">copy</a><div style="position: absolute; left: 162px; top: 1328px; width: 16px; height: 16px; z-index: 99;"><embed id="ZeroClipboardMovie_1" src="http://static.blog.csdn.net/scripts/ZeroClipboard/ZeroClipboard.swf" loop="false" menu="false" quality="best" bgcolor="#ffffff" name="ZeroClipboardMovie_1" allowscriptaccess="always" allowfullscreen="false" type="application/x-shockwave-flash" pluginspage="http://www.macromedia.com/go/getflashplayer" flashvars="id=1&width=16&height=16" wmode="transparent" align="middle" height="16" width="16"></div></span><span class="tracking-ad" data-mod="popu_169"> <a href="#" class="PrintSource" title="print" οnclick="dp.sh.Toolbar.Command('PrintSource',this);return false;">print</a></span><a href="#" class="About" title="?" οnclick="dp.sh.Toolbar.Command('About',this);return false;">?</a></div></div><ol start="1" class="dp-cpp"><li class="alt"><span><span>linux@ubuntu:~/workdir/ACM-ICPC$ cat IntDivide.c </span></span></li><li class=""><span><span class="preprocessor">#include <stdio.h></span><span> </span></span></li><li class="alt"><span> </span></li><li class=""><span><span class="datatypes">int</span><span> IntDivide(</span><span class="datatypes">int</span><span> n, </span><span class="datatypes">int</span><span> m) </span></span></li><li class="alt"><span>{ </span></li><li class=""><span> <span class="keyword">if</span><span>((n<1)||(m<1)) </span></span></li><li class="alt"><span> <span class="keyword">return</span><span> 0; </span></span></li><li class=""><span> <span class="keyword">if</span><span>((n==1)||(m==1)) </span></span></li><li class="alt"><span> <span class="keyword">return</span><span> 1; </span></span></li><li class=""><span> <span class="keyword">if</span><span>(n<m) </span></span></li><li class="alt"><span> <span class="keyword">return</span><span> IntDivide(n,n); </span></span></li><li class=""><span> <span class="keyword">if</span><span>(n==m) </span></span></li><li class="alt"><span> <span class="keyword">return</span><span> IntDivide(n,n-1)+1; </span></span></li><li class=""><span> <span class="keyword">return</span><span> IntDivide(n-m,m)+IntDivide(n,m-1); </span></span></li><li class="alt"><span>} </span></li><li class=""><span> </span></li><li class="alt"><span><span class="datatypes">int</span><span> main() </span></span></li><li class=""><span>{ </span></li><li class="alt"><span> <span class="datatypes">int</span><span> n=0,m=0; </span></span></li><li class=""><span> <span class="datatypes">int</span><span> result=0; </span></span></li><li class="alt"><span> </span></li><li class=""><span> scanf(<span class="string">"%d %d"</span><span>,&n,&m); </span></span></li><li class="alt"><span> </span></li><li class=""><span> result = IntDivide(n,m); </span></li><li class="alt"><span> </span></li><li class=""><span> printf(<span class="string">"%d\n"</span><span>,result); </span></span></li><li class="alt"><span> </span></li><li class=""><span> <span class="keyword">return</span><span> 0; </span></span></li><li class="alt"><span>} </span></li></ol></div><pre class="cpp" name="code" style="display: none;">linux@ubuntu:~/workdir/ACM-ICPC$ cat IntDivide.c
#include <stdio.h>
int IntDivide(int n, int m)
{
if((n<1)||(m<1))
return 0;
if((n==1)||(m==1))
return 1;
if(n<m)
return IntDivide(n,n);
if(n==m)
return IntDivide(n,n-1)+1;
return IntDivide(n-m,m)+IntDivide(n,m-1);
}
int main()
{
int n=0,m=0;
int result=0;
scanf("%d %d",&n,&m);
result = IntDivide(n,m);
printf("%d\n",result);
return 0;
}
</pre><br> </div>
</article>
<div class="readall_box csdn-tracking-statistics tracking-click readall_box_nobg" data-mod="popu_376" style="display: none;">
<div class="read_more_mask"></div>
<a class="btn btn-large btn-gray-fred read_more_btn" target="_self">阅读全文</a>
</div>
<div class="article_copyright">
</div>
<ul class="article_collect clearfix csdn-tracking-statistics tracking-click" data-mod="popu_378" style="display: none;">
<li class="tit">本文已收录于以下专栏：</li>
<!-- [startarticlecolumns]-->
<!-- [endarticlecolumns]-->
</ul>
<div class="comment_box clearfix">
<div id="comment_form">
<div id="commentsbmitarear">
<div class="comment_area clearfix" style="height: 60px;">
<div class="userimg">
<a href="http://my.csdn.net/kind_boy123">
<img src="http://avatar.csdn.net/7/A/5/3_kind_boy123.jpg">
</a>
</div>
<form action="http://blog.csdn.net/xiezhongtian/phoenix/comment/submit?id=17797151" method="post" οnsubmit="return subform(this);" id="commentform">
<textarea class="comment_content" name="comment_content" id="comment_content" placeholder="发表你的评论" style="display: inline-block; height: 40px;"></textarea>
<div class="bot_bar clearfix" style="opacity: 0;">
<div id="ubbtools" class="add_code">
<a href="#insertcode" code="code" target="_self"><i class="icon iconfont icon-daima"></i></a>
</div>
<input id="comment_replyId" name="comment_replyId" type="hidden">
<input id="comment_userId" name="comment_userId" value="" type="hidden">
<input id="commentId" name="commentId" value="" type="hidden">
<input class="btn btn-redborder" value="发表评论" type="submit">
<span id="tip_comment" class="tip">
<div style="display: none;" class="csdn-tracking-statistics tracking-click" data-mod="popu_384"><a href="#" target="_blank" class="comment_area_btn">发表评论</a></div>
<div id="lang_list" code="code">
<a href="#html" style="width:95px;" class="long_name" target="_self">HTML/XML</a>
<a href="#objc" style="width:95px;" class="long_name" target="_self">objective-c</a>
<a href="#delphi" style="width:58px;" class="zhong_name" target="_self">Delphi</a>
<a href="#ruby" class="zhong_name" target="_self">Ruby</a>
<a href="#php" target="_self">PHP</a>
<a href="#csharp" class="duan_name" target="_self">C#</a>
<a style=" border-right: none;" href="#cpp" class="duan_name" target="_self">C++</a>
<a style=" border-bottom:none;width:95px;" href="#javascript" class="long_name" target="_self">JavaScript</a>
<a style=" border-bottom:none;width:95px;" href="#vb" class="long_name" target="_self">Visual Basic</a>
<a style=" border-bottom:none;" href="#python" class="zhong_name" target="_self">Python</a>
<a style=" border-bottom:none;" href="#java" class="zhong_name" target="_self">Java</a>
<a style="border-bottom:none;" href="#css" class="duan_name" target="_self">CSS</a>
<a style="border-bottom:none;" href="#sql" class="duan_name" target="_self">SQL</a>
<a style="border:none; " href="#plain" class="duan_name" target="_self">其它</a>
<span class="arrb"></span>
</div>
</span></div>
</form>
</div>
</div>
</div>
</div>
<div class="comment_li_outbox"></div>
<div class="more_comment" style="display: none;">
<div id="comment_bar" class="trackgin-ad" data-mod="popu_385"></div>
</div>
<!-- <h3 class="recommend_tit" id="related">相关文章推荐</h3> -->
<div class="recommend_list clearfix" id="rasss">
<dl class="clearfix csdn-tracking-statistics recommend_article recommend_article_out" data-mod="popu_387" data-poputype="feed" data-feed-show="true" data-dsm="post">
<a href="http://blog.csdn.net/oopos/article/details/1826808" target="_blank" strategy="BlogCommendFromBaidu_0">
<dd class="clearfix">
<h2 class="" style="margin-bottom: 0px;">整数划分问题(C语言求解)</h2>
<ul class="floatR">
<li class="avatar_img"><img src="http://avatar.csdn.net/4/3/9/3_oopos.jpg" alt="oopos" title="oopos"></li>
<li class="user_name">oopos</li>
<li class="time">2007年10月16日 09:09</li>
<li class="visited_num"><i class="icon iconfont icon-read"></i><span>1535</span></li>
</ul><div class="summary">
/**//*描述 Description 将整数n分成k份，且每份不能为空，任意两份不能相同(不考虑顺序)。例如：n=7，k=3，下面三种分法被认为是相同的。1,1,5; 1,5,1; 5... </div>
</dd>
</a>
</dl>
<dl class="clearfix csdn-tracking-statistics recommend_article recommend_article_out" data-mod="popu_387" data-poputype="feed" data-feed-show="true" data-dsm="post">
<a href="http://blog.csdn.net/xiezhongtian/article/details/17797151" target="_blank" strategy="BlogCommendFromQuerySearch_1">
<dd class="clearfix">
<h2 class="" style="margin-bottom: 0px;">整数划分问题的递归算法-c语言</h2>
<ul class="floatR">
<li class="avatar_img"><img src="http://avatar.csdn.net/8/E/1/3_xiezhongtian.jpg" alt="xiezhongtian" title="xiezhongtian"></li>
<li class="user_name">xiezhongtian</li>
<li class="time">2014年01月03日 18:46</li>
<li class="visited_num"><i class="icon iconfont icon-read"></i><span>1976</span></li>
</ul><div class="summary">
整数划分问题是算法中的一个经典命题之一，有关这个问题的讲述在讲解到递归时基本都将涉及。所谓整数划分，是指把一个正整数n写成如下形式：
n=m1+m2+...+mi; （其中mi为正... </div>
</dd>
</a>
</dl>
<script>
(function() {
var s = "_" + Math.random().toString(36).slice(2);
document.write('<div id="' + s + '"></div>');
(window.slotbydup=window.slotbydup || []).push({
id: '4765209',
container: s,
size: '808,120',
display: 'inlay-fix'
});
})();
</script><div id="_jv50dfnf5yk"></div><script charset="utf-8" src="http://pos.baidu.com/dcvm?di=4765209&dri=0&dis=0&dai=0&ps=2486x15&enu=encoding&dcb=___adblockplus&dtm=SSP_JSONP&dvi=0.0&dci=-1&dpt=none&tsr=0&tpr=1515590766342&ti=%E6%95%B4%E6%95%B0%E5%88%92%E5%88%86%E9%97%AE%E9%A2%98%E7%9A%84%E9%80%92%E5%BD%92%E7%AE%97%E6%B3%95-c%E8%AF%AD%E8%A8%80%20-%20CSDN%E5%8D%9A%E5%AE%A2&ari=2&dbv=0&drs=1&pcs=1008x582&pss=1160x2510&cfv=28&cpl=19&chi=1&cce=true&cec=UTF-8&tlm=1515590766&rw=598<u=http%3A%2F%2Fblog.csdn.net%2Fpunk_lover%2Farticle%2Fdetails%2F17797151<r=https%3A%2F%2Fwww.baidu.com%2Flink%3Furl%3DKc4IQ5p2hNu4oEzoH2zD6x3htcctMNir5Yj7AtTZdsMpILqVsVihJTMIqRNt0udsslI2SkA-rv8t_cLxMbzqTnDFHCmi3D_mqK9Q88ISePy%26wd%3D%26eqid%3Db88875b60000c859000000055a561261&lcr=https%3A%2F%2Fwww.baidu.com%2Flink%3Furl%3DKc4IQ5p2hNu4oEzoH2zD6x3htcctMNir5Yj7AtTZdsMpILqVsVihJTMIqRNt0udsslI2SkA-rv8t_cLxMbzqTnDFHCmi3D_mqK9Q88ISePy%26wd%3D%26eqid%3Db88875b60000c859000000055a561261&ecd=1&uc=1024x740&pis=-1x-1&sr=1024x768&tcn=1515590766"></script><a href="http://www.baidu.com/cb.php?c=IgF_pyfqnHmknjb3nH00IZ0qnfK9ujYzP1ndPWb10Aw-5Hc3rHnYnHb0TAq15HfLPWRznjb0T1dBmWmsP1NhPvw9mH9Bmhmk0AwY5HDdnHRdrH0Ln1m0IgF_5y9YIZ0lQzq-uZR8mLPbUB48ugfEIAqspynEIvNBnWqdIAdxTvqdThP-5yF_UvTkn0KzujYkrfKBUHYs0ZKz5H00Iy-b5HDdP1f1PWD0Uv-b5HDzrH63nHf0mv-b5HTzPWb1n6KEIv3qn0KsXHYznjm0mLFW5HR3PWcv" target="_blank">
<dl class="clearfix csdn-tracking-statistics" data-mod="popu_393">
<dt style="position: relative;"><img class="maxwidth" src="http://ubmcmm.baidustatic.com/media/v1/0f000DH99Ppfg7rnLq-JX0.jpg" alt="" title=""><img class="append_mark_img" style="display:block;position:absolute;left:0;bottom:0;width:30px;height:16px" src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAB4AAAAQCAYAAAABOs/SAAAABGdBTUEAALGPC/xhBQAAAhpJREFUOBHFVU2L2lAUHU0nExNHbRq1BkSrSFH8QBdu3QnuxYUr3bj2f/gHRPwrdmVdCLqxIK0KighqWz+mNVPaavtuhgtqnpnposyD5N53z7k57yX33RhKpdK7q2cYxmfQVCUfFU6n06/z+fwbvQWaTCYml8t5gBOJRKzZbFb19XJenIPhcNgaj8dfYZxlWSYWizkZhjFgDGyr1VqMRqMd+JlMRrbZbDd2u/3G4XBwTqeTBx8wGLvd7reiKPuH2cNdI+zz+W4FQbjudrtfkNjr9Vboo91sNr/A9/v9QjKZlFer1X2xWHxLclnIBx+5nU5n0Wg0FjgHqxGG4Hw+V9rt9lfw9YbRaDQUCoVgtVr9MB6P1d2TRYjRaFSq1+uf9HKpwnoJx5jL5eKazebM4/EIcAHmdrvNkiSZUqmU45g7HA6/zWaze4xphDmOY7bb7U8k6FmLxXItiiJ3zNnv938mk8mdLMvqQhBbLpc/dIXNZjM7nU6/Y4Ke7ff7d3AFAoFbUoQnxYd5h8PhCjg4R6vZMQiTQnnSjvEhpAmFB4OBpgABD4VCUrlcfo9ctBphcgx4eC1IeKqt1WofadxKpSLS4ifC5Ltw5Bsd1uu1elRoCZdiiUTiJQ2DyqfFT4SDwaCVnNnPNOJjMdKxqDs7bzz4HMP5T4Lneea8yyD5kvV6vTw5xwoNv4RpevW/ioLYJVE9TCNMW/X/iP0FJ9WyNfNE5tcAAAAASUVORK5CYII="></dt>
<dd>
<div class="summary">
<h2>【分享】成为编程高手的路上，我避开了哪些坑儿？！</h2> <div class="summary">同是程序员，有的前端8k，有的前端月薪20k，背后的原因是什么，我经历的经验分享给你们....</div>
</div>
</dd>
</dl>
</a>
<dl class="clearfix csdn-tracking-statistics recommend_article recommend_article_out" data-mod="popu_387" data-poputype="feed" data-feed-show="false" data-dsm="post">
<a href="http://blog.csdn.net/chzayi/article/details/44701811" target="_blank" strategy="BlogCommendFromQuerySearch_2">
<dd class="clearfix">
<h2 class="">整数划分如，对于正整数n=6，可以分划为：6 5+1</h2>
<div class="summary">
整数划分
如，对于正整数n=6，可以分划为：
6
5+1
4+2, 4+1+1
3+3, 3+2+1, 3+1+1+1
2+2+2, 2+2+1+1, 2+1+1+1+1
1+1+1+1+... </div>
<ul class="">
<li class="avatar_img"><img src="http://avatar.csdn.net/6/B/B/3_chzayi.jpg" alt="chzayi" title="chzayi"></li>
<li class="user_name">chzayi</li>
<li class="time">2015年03月28日 15:21</li>
<li class="visited_num"><i class="icon iconfont icon-read"></i><span>1613</span></li>
</ul>
</dd>
</a>
</dl>
<dl class="clearfix csdn-tracking-statistics recommend_article recommend_article_out" data-mod="popu_387" data-poputype="feed" data-feed-show="false" data-dsm="post">
<a href="http://blog.csdn.net/kucece/article/details/46759235" target="_blank" strategy="BlogCommendFromQuerySearch_3">
<dd class="clearfix">
<h2 class="" style="margin-bottom: 0px;">openjudge 简单的整数划分问题</h2>
<ul class="floatR">
<li class="avatar_img"><img src="http://avatar.csdn.net/4/6/2/3_kucece.jpg" alt="kucece" title="kucece"></li>
<li class="user_name">kucece</li>
<li class="time">2015年07月04日 23:27</li>
<li class="visited_num"><i class="icon iconfont icon-read"></i><span>1818</span></li>
</ul><div class="summary">
T2:简单的整数划分问题
查看提交统计提问
总时间限制: 100ms 内存限制: 65536kB
描述
将正整数n 表示成一系列正整数之和，n=n1+n2+…+nk, 其中n1>=n2>=... </div>
</dd>
</a>
</dl>
<dl class="clearfix csdn-tracking-statistics downloadElement" data-mod="popu_387" data-poputype="feed" data-feed-show="false" data-dsm="post">
<a class="clearfix" href="http://download.csdn.net/download/huanxisha88/2333938" target="_blank" strategy="BlogCommendFromCsdn_4">
<dd class="floatL">
<div class="summary">
<h2>背包问题的递归算法，C语言实现</h2>
<div class="summary">
<ul>
<li class="time">2010年05月09日 21:55</li>
<li class="visited_num fileSize">24KB</li>
<li class="download_btn">下载</li>
</ul>
</div>
</div>
</dd>
<dt class="floatR"><img class="maxwidth" src="http://csdnimg.cn/release/download/old_static/images/minetype/doc.svg" alt="" title=""></dt>
</a>
</dl>
<!-- 广告位：PC端-博客详情通栏7（feed流）-808*120 -->
<script>
(function() {
var s = "_" + Math.random().toString(36).slice(2);
document.write('<div id="' + s + '"></div>');
(window.slotbydup=window.slotbydup || []).push({
id: '4983339',
container: s,
size: '808,120',
display: 'inlay-fix'
});
})();
</script><div id="_0ygmb3r6s9ni"></div><script charset="utf-8" src="http://pos.baidu.com/dcvm?di=4983339&dri=0&dis=0&dai=0&ps=3048x15&enu=encoding&dcb=___adblockplus&dtm=SSP_JSONP&dvi=0.0&dci=-1&dpt=none&tsr=0&tpr=1515590766342&ti=%E6%95%B4%E6%95%B0%E5%88%92%E5%88%86%E9%97%AE%E9%A2%98%E7%9A%84%E9%80%92%E5%BD%92%E7%AE%97%E6%B3%95-c%E8%AF%AD%E8%A8%80%20-%20CSDN%E5%8D%9A%E5%AE%A2&ari=2&dbv=0&drs=1&pcs=1008x582&pss=1160x3072&cfv=28&cpl=19&chi=1&cce=true&cec=UTF-8&tlm=1515590766&rw=598<u=http%3A%2F%2Fblog.csdn.net%2Fpunk_lover%2Farticle%2Fdetails%2F17797151<r=https%3A%2F%2Fwww.baidu.com%2Flink%3Furl%3DKc4IQ5p2hNu4oEzoH2zD6x3htcctMNir5Yj7AtTZdsMpILqVsVihJTMIqRNt0udsslI2SkA-rv8t_cLxMbzqTnDFHCmi3D_mqK9Q88ISePy%26wd%3D%26eqid%3Db88875b60000c859000000055a561261&lcr=https%3A%2F%2Fwww.baidu.com%2Flink%3Furl%3DKc4IQ5p2hNu4oEzoH2zD6x3htcctMNir5Yj7AtTZdsMpILqVsVihJTMIqRNt0udsslI2SkA-rv8t_cLxMbzqTnDFHCmi3D_mqK9Q88ISePy%26wd%3D%26eqid%3Db88875b60000c859000000055a561261&ecd=1&uc=1024x740&pis=-1x-1&sr=1024x768&tcn=1515590767"></script><iframe style="width: 100%; height: 144px; border: 0px none;" scrolling="no"></iframe>
<dl class="clearfix csdn-tracking-statistics recommend_article recommend_article_out" data-mod="popu_387" data-poputype="feed" data-feed-show="false" data-dsm="post">
<a href="http://blog.csdn.net/u012965373/article/details/42466533" target="_blank" strategy="BlogCommendFromCsdn_5">
<dd class="clearfix">
<h2 class="" style="margin-bottom: 0px;">整数划分问题 ----- 递归算法</h2>
<ul class="floatR">
<li class="avatar_img"><img src="http://avatar.csdn.net/8/E/A/3_u012965373.jpg" alt="u012965373" title="u012965373"></li>
<li class="user_name">u012965373</li>
<li class="time">2015年01月06日 20:44</li>
<li class="visited_num"><i class="icon iconfont icon-read"></i><span>513</span></li>
</ul><div class="summary">
对于整数划分我想看到这篇博客的人一定不陌生。
4 = 1 + 1 + 1 +1；
4 = 1 + 3；
4 = 1 + 1 + 2；
4 = 4；
4 = 2 + 2；共五种分法。
... </div>
</dd>
</a>
</dl>
<dl class="clearfix csdn-tracking-statistics recommend_article recommend_article_out" data-mod="popu_387" data-poputype="feed" data-feed-show="false" data-dsm="post">
<a href="http://blog.csdn.net/OrdinaryCrazy/article/details/77017920" target="_blank" strategy="BlogCommendFromCsdn_6">
<dd class="clearfix">
<h2 class="" style="margin-bottom: 0px;">百炼-1321-棋盘问题-C语言-递归算法</h2>
<ul class="floatR">
<li class="avatar_img"><img src="http://avatar.csdn.net/A/6/7/3_ordinarycrazy.jpg" alt="OrdinaryCrazy" title="OrdinaryCrazy"></li>
<li class="user_name">OrdinaryCrazy</li>
<li class="time">2017年08月09日 22:47</li>
<li class="visited_num"><i class="icon iconfont icon-read"></i><span>223</span></li>
</ul><div class="summary">
描述：
在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆... </div>
</dd>
</a>
</dl>
<dl class="clearfix csdn-tracking-statistics recommend_article recommend_article_out" data-mod="popu_387" data-poputype="feed" data-feed-show="false" data-dsm="post">
<a href="http://blog.csdn.net/zimou5581/article/details/52809565" target="_blank" strategy="BlogCommendFromCsdn_7">
<dd class="clearfix">
<h2 class="">递归算法——Hanoi（汉诺）问题(Java实现&C语言实现)</h2>
<div class="summary">
某寺庙前有三根柱子A、B、C，开始时A柱上有n个盘子，盘子大小不等，大的在下、小的在上（下图所示）。有一老和尚想把这n个盘子从A柱移到C柱上，但每次只允许移动一个盘子，且在移动过程序中每根柱子上都始终... </div>
<ul class="">
<li class="avatar_img"><img src="http://avatar.csdn.net/9/F/5/3_zimou5581.jpg" alt="zimou5581" title="zimou5581"></li>
<li class="user_name">zimou5581</li>
<li class="time">2016年10月13日 19:52</li>
<li class="visited_num"><i class="icon iconfont icon-read"></i><span>1132</span></li>
</ul>
</dd>
</a>
</dl>
<dl class="clearfix csdn-tracking-statistics recommend_article recommend_article_out" data-mod="popu_387" data-poputype="feed" data-feed-show="false" data-dsm="post">
<a href="http://blog.csdn.net/OrdinaryCrazy/article/details/76856018" target="_blank" strategy="BlogCommendFromCsdn_8">
<dd class="clearfix">
<h2 class="" style="margin-bottom: 0px;">百炼-2815-城堡问题-C语言-递归算法</h2>
<ul class="floatR">
<li class="avatar_img"><img src="http://avatar.csdn.net/A/6/7/3_ordinarycrazy.jpg" alt="OrdinaryCrazy" title="OrdinaryCrazy"></li>
<li class="user_name">OrdinaryCrazy</li>
<li class="time">2017年08月07日 19:54</li>
<li class="visited_num"><i class="icon iconfont icon-read"></i><span>122</span></li>
</ul><div class="summary">
首先是一种比较直观的解法，虽然原理没问题，但实现的就不是很有技巧了。
/*************************************************
**文件名：百炼-2815
... </div>
</dd>
</a>
</dl>
<dl class="clearfix csdn-tracking-statistics recommend_article recommend_article_out" data-mod="popu_387" data-poputype="feed" data-feed-show="false" data-dsm="post">
<a href="http://blog.csdn.net/astina2011/article/details/45051123" target="_blank" strategy="BlogCommendFromCsdn_9">
<dd class="clearfix">
<h2 class="">[黑马程序员]04[c语言]递归算法的妙用, 捕鱼量算法问题</h2>
<div class="summary">
前言:
当我们学习到函数的时候,主要涉及到的是函数的基本语法以及函数的封装,最后在听到递推关系式时,提到了递推函数
的概念. 提及的是,递推函数虽然在解决部分递推关系时比较方便,有一定的好处,... </div>
<ul class="">
<li class="avatar_img"><img src="http://avatar.csdn.net/B/9/E/3_astina2011.jpg" alt="astina2011" title="astina2011"></li>
<li class="user_name">astina2011</li>
<li class="time">2015年04月15日 01:10</li>
<li class="visited_num"><i class="icon iconfont icon-read"></i><span>659</span></li>
</ul>
</dd>
</a>
</dl>
<dl class="clearfix csdn-tracking-statistics downloadElement" data-mod="popu_387" data-poputype="feed" data-feed-show="false" data-dsm="post">
<a class="clearfix" href="http://download.csdn.net/download/tomato_potato/160598" target="_blank" strategy="BlogCommendFromCsdn_10">
<dd class="floatL">
<div class="summary">
<h2>C语言全排列的递归算法</h2>
<div class="summary">
<ul>
<li class="time">2007年01月12日 14:45</li>
<li class="visited_num fileSize">426B</li>
<li class="download_btn">下载</li>
</ul>
</div>
</div>
</dd>
<dt class="floatR"><img class="maxwidth" src="http://csdnimg.cn/release/download/old_static/images/minetype/rar.svg" alt="" title=""></dt>
</a>
</dl>
<dl class="clearfix csdn-tracking-statistics downloadElement" data-mod="popu_387" data-poputype="feed" data-feed-show="false" data-dsm="post">
<a class="clearfix" href="http://download.csdn.net/download/cherryendy/4275485" target="_blank" strategy="BlogCommendFromCsdn_11">
<dd class="floatL">
<div class="summary">
<h2>递归算法实现组合(c语言实现,平台：Automation Studio@AR system)</h2>
<div class="summary">
<ul>
<li class="time">2012年05月04日 11:31</li>
<li class="visited_num fileSize">916KB</li>
<li class="download_btn">下载</li>
</ul>
</div>
</div>
</dd>
<dt class="floatR"><img class="maxwidth" src="http://csdnimg.cn/release/download/old_static/images/minetype/pdf.svg" alt="" title=""></dt>
</a>
</dl>
<dl class="clearfix csdn-tracking-statistics recommend_article recommend_article_out" data-mod="popu_387" data-poputype="feed" data-feed-show="false" data-dsm="post">
<a href="http://blog.csdn.net/catkint/article/details/50354689" target="_blank" strategy="BlogCommendFromCsdn_12">
<dd>
<h2>数据结构 二叉树的递归算法、前序、中序、后序遍历(c语言实现)</h2>
<div class="summary">
实验目的
1、掌握二叉树的表示与实现。
2、掌握二叉树的定义、创建、遍历等基本操作的实现。
3、熟悉求二叉树深度等递归算法的设计与实现。
实验内容
问题描述：已知二叉树t，分别采用顺序存储结... </div>
<ul>
<li class="avatar_img"><img src="http://avatar.csdn.net/B/8/3/3_catkint.jpg" alt="catkint" title="catkint"></li>
<li class="user_name">catkint</li>
<li class="time">2015年12月18日 23:08</li>
<li class="visited_num"><i class="icon iconfont icon-read"></i><span>5408</span></li>
</ul>
</dd>
</a>
</dl>
<dl class="clearfix csdn-tracking-statistics downloadElement" data-mod="popu_387" data-poputype="feed" data-feed-show="false" data-dsm="post">
<a class="clearfix" href="http://download.csdn.net/download/jason19905/6419471" target="_blank" strategy="BlogCommendFromCsdn_13">
<dd class="floatL">
<div class="summary">
<h2>汉诺塔的递归算法 C语言</h2>
<div class="summary">
<ul>
<li class="time">2013年10月18日 16:14</li>
<li class="visited_num fileSize">464B</li>
<li class="download_btn">下载</li>
</ul>
</div>
</div>
</dd>
<dt class="floatR"><img class="maxwidth" src="http://csdnimg.cn/release/download/old_static/images/minetype/unkonw.svg" alt="" title=""></dt>
</a>
</dl>
<dl class="clearfix csdn-tracking-statistics downloadElement" data-mod="popu_387" data-poputype="feed" data-feed-show="false" data-dsm="post">
<a class="clearfix" href="http://download.csdn.net/download/luoyikun/4926437" target="_blank" strategy="BlogCommendFromCsdn_14">
<dd class="floatL">
<div class="summary">
<h2>c语言汉诺塔的递归算法</h2>
<div class="summary">
<ul>
<li class="time">2012年12月25日 14:57</li>
<li class="visited_num fileSize">206KB</li>
<li class="download_btn">下载</li>
</ul>
</div>
</div>
</dd>
<dt class="floatR"><img class="maxwidth" src="http://csdnimg.cn/release/download/old_static/images/minetype/zip.svg" alt="" title=""></dt>
</a>
</dl>
<dl class="clearfix csdn-tracking-statistics recommend_article recommend_article_out" data-mod="popu_387" data-poputype="feed" data-feed-show="false" data-dsm="post">
<a href="http://blog.csdn.net/zhuyi2654715/article/details/6773018" target="_blank" strategy="BlogCommendFromCsdn_15">
<dd>
<h2>二叉树的建立与输出以及其他一些相关操作(递归算法实现) C语言</h2>
<div class="summary">
/********************************************************/
#include
#include
#include
/******... </div>
<ul>
<li class="avatar_img"><img src="http://avatar.csdn.net/5/2/8/3_zhuyi2654715.jpg" alt="zhuyi2654715" title="zhuyi2654715"></li>
<li class="user_name">zhuyi2654715</li>
<li class="time">2011年09月13日 23:50</li>
<li class="visited_num"><i class="icon iconfont icon-read"></i><span>7069</span></li>
</ul>
</dd>
</a>
</dl>
<dl class="clearfix csdn-tracking-statistics recommend_article recommend_article_out" data-mod="popu_387" data-poputype="feed" data-feed-show="false" data-dsm="post">
<a href="http://blog.csdn.net/huangbo201102/article/details/18968983" target="_blank" strategy="BlogCommendFromCsdn_16">
<dd>
<h2 style="margin-bottom: 0px;">二叉树的遍历（c语言非递归算法）</h2>
<ul class="floatR">
<li class="avatar_img"><img src="http://avatar.csdn.net/1/D/A/3_huangbo201102.jpg" alt="huangbo201102" title="huangbo201102"></li>
<li class="user_name">huangbo201102</li>
<li class="time">2014年02月07日 20:12</li>
<li class="visited_num"><i class="icon iconfont icon-read"></i><span>678</span></li>
</ul><div class="summary">
二叉树的遍历有三种方式，如下：
（1）前序遍历（DLR），首先访问根结点，然后遍历左子树，最后遍历右子树。简记根-左-右。
（2）中序遍历（LDR），首先遍历左子树，然后访问根结点，最后遍... </div>
</dd>
</a>
</dl>
<dl class="clearfix csdn-tracking-statistics recommend_article recommend_article_out" data-mod="popu_387" data-poputype="feed" data-feed-show="false" data-dsm="post">
<a href="http://blog.csdn.net/gaojinshan/article/details/7842991" target="_blank" strategy="BlogCommendFromCsdn_17">
<dd>
<h2 style="margin-bottom: 0px;">排列和组合的非递归算法的C语言实现</h2>
<ul class="floatR">
<li class="avatar_img"><img src="http://avatar.csdn.net/D/1/F/3_gaojinshan.jpg" alt="gaojinshan" title="gaojinshan"></li>
<li class="user_name">gaojinshan</li>
<li class="time">2012年08月08日 13:05</li>
<li class="visited_num"><i class="icon iconfont icon-read"></i><span>3276</span></li>
</ul><div class="summary">
2008-11-28 09:56
#include
#include
//从n个元素的数组a中，取m个元素的组合
bool zuhe(char a[],int n,int m)
... </div>
</dd>
</a>
</dl>
<dl class="clearfix csdn-tracking-statistics recommend_article recommend_article_out" data-mod="popu_387" data-poputype="feed" data-feed-show="false" data-dsm="post">
<a href="http://blog.csdn.net/Csdn_zc/article/details/7019833" target="_blank" strategy="BlogCommendFromCsdn_18">
<dd>
<h2 style="margin-bottom: 0px;">C语言实现单链表翻转的递归算法</h2>
<ul class="floatR">
<li class="avatar_img"><img src="http://avatar.csdn.net/D/1/E/3_csdn_zc.jpg" alt="Csdn_zc" title="Csdn_zc"></li>
<li class="user_name">Csdn_zc</li>
<li class="time">2011年11月28日 15:46</li>
<li class="visited_num"><i class="icon iconfont icon-read"></i><span>4043</span></li>
</ul><div class="summary">
/*
Code by : EricYou
http://www.cnblogs.com/yxin1322
Date: 2006.1.14
*/
#include
... </div>
</dd>
</a>
</dl>
<dl class="clearfix csdn-tracking-statistics recommend_article recommend_article_out" data-mod="popu_387" data-poputype="feed" data-feed-show="false" data-dsm="post">
<a href="http://blog.csdn.net/jia12216/article/details/46609503" target="_blank" strategy="BlogCommendFromCsdn_19">
<dd>
<h2 style="margin-bottom: 0px;">约瑟夫环的C语言和86/88汇编非递归算法</h2>
<ul class="floatR">
<li class="avatar_img"><img src="http://avatar.csdn.net/A/5/B/3_jia12216.jpg" alt="jia12216" title="jia12216"></li>
<li class="user_name">jia12216</li>
<li class="time">2015年06月23日 19:50</li>
<li class="visited_num"><i class="icon iconfont icon-read"></i><span>1145</span></li>
</ul><div class="summary">
约瑟夫环（约瑟夫问题）是一个数学的应用问题：已知n个人（以编号1，2，3…n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；... </div>
</dd>
</a>
</dl>
</div>
</main>
<aside>
<div class="right_box user_info">
<dl class="inf_bar clearfix">
<dt class="csdn-tracking-statistics tracking-click" data-mod="popu_381">
<a href="http://blog.csdn.net/xiezhongtian" target="_blank">
<img src="http://avatar.csdn.net/8/E/1/3_xiezhongtian.jpg" class="avatar_pic">
</a>
<span class="medals" title="">
</span>
</dt>
<dd>
<h3 class="csdn-tracking-statistics tracking-click" data-mod="popu_380"><a href="http://blog.csdn.net/xiezhongtian" target="_blank" id="uid">zhongtianemail</a></h3>
<span class="csdn-tracking-statistics tracking-click" data-mod="popu_379"><a class="btn btn-redborder-small " id="span_add_follow" target="_self">＋关注</a></span>
</dd>
</dl>
<div class="inf_number_box clearfix">
<dl>
<dt>原创</dt>
<dd>64</dd>
</dl>
<dl>
<dt>粉丝</dt>
<dd id="fan">4</dd>
</dl>
<dl>
<dt>喜欢</dt>
<dd>6</dd>
</dl>
<dl>
<dt>码云</dt>
<dd><a href="https://gitee.com/zhongtianxie?utm_source=csdn_blog" target="_blank">3</a></dd>
</dl>
</div>
</div>
<div class="extension_other csdn-tracking-statistics tracking-click" data-mod="popu_389" style="position: relative;">
<!--u3032528-->
<div class="flashrecommend">
<div id="_oh2ceq1t0wd"><iframe scrolling="no" src="http://pos.baidu.com/s?hei=250&wid=300&di=u3032528<u=http%3A%2F%2Fblog.csdn.net%2Fpunk_lover%2Farticle%2Fdetails%2F17797151&tlm=1515590766&col=zh-CN&ti=%E6%95%B4%E6%95%B0%E5%88%92%E5%88%86%E9%97%AE%E9%A2%98%E7%9A%84%E9%80%92%E5%BD%92%E7%AE%97%E6%B3%95-c%E8%AF%AD%E8%A8%80%20-%20CSDN%E5%8D%9A%E5%AE%A2&drs=1&exps=111000<r=https%3A%2F%2Fwww.baidu.com%2Flink%3Furl%3DKc4IQ5p2hNu4oEzoH2zD6x3htcctMNir5Yj7AtTZdsMpILqVsVihJTMIqRNt0udsslI2SkA-rv8t_cLxMbzqTnDFHCmi3D_mqK9Q88ISePy%26wd%3D%26eqid%3Db88875b60000c859000000055a561261&pcs=1008x582&chi=1&cja=false&psr=1024x768&tpr=1515590766762&dc=2&dis=0&cdo=-1&cfv=28&ant=0&par=1024x740&ccd=24&cec=UTF-8&tcn=1515590767&dtm=HTML_POST&pis=-1x-1&cmi=36&cce=true&dai=1&ps=254x847&pss=1160x3916&cpl=19&ari=2&dri=0" frameborder="0" height="250" width="300"></iframe><abbr style="width:0px;height:0px;margin-top:0px;"></abbr></div><script type="text/javascript" src="http://mpb1.iteye.com/bwocoltlyzdec.js"></script>
</div>
<img class="append_mark_img" style="display:block;position:absolute;left:0;bottom:0;width:30px;height:16px" src="data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAB4AAAAQCAYAAAABOs/SAAAABGdBTUEAALGPC/xhBQAAAhpJREFUOBHFVU2L2lAUHU0nExNHbRq1BkSrSFH8QBdu3QnuxYUr3bj2f/gHRPwrdmVdCLqxIK0KighqWz+mNVPaavtuhgtqnpnposyD5N53z7k57yX33RhKpdK7q2cYxmfQVCUfFU6n06/z+fwbvQWaTCYml8t5gBOJRKzZbFb19XJenIPhcNgaj8dfYZxlWSYWizkZhjFgDGyr1VqMRqMd+JlMRrbZbDd2u/3G4XBwTqeTBx8wGLvd7reiKPuH2cNdI+zz+W4FQbjudrtfkNjr9Vboo91sNr/A9/v9QjKZlFer1X2xWHxLclnIBx+5nU5n0Wg0FjgHqxGG4Hw+V9rt9lfw9YbRaDQUCoVgtVr9MB6P1d2TRYjRaFSq1+uf9HKpwnoJx5jL5eKazebM4/EIcAHmdrvNkiSZUqmU45g7HA6/zWaze4xphDmOY7bb7U8k6FmLxXItiiJ3zNnv938mk8mdLMvqQhBbLpc/dIXNZjM7nU6/Y4Ke7ff7d3AFAoFbUoQnxYd5h8PhCjg4R6vZMQiTQnnSjvEhpAmFB4OBpgABD4VCUrlcfo9ctBphcgx4eC1IeKqt1WofadxKpSLS4ifC5Ltw5Bsd1uu1elRoCZdiiUTiJQ2DyqfFT4SDwaCVnNnPNOJjMdKxqDs7bzz4HMP5T4Lneea8yyD5kvV6vTw5xwoNv4RpevW/ioLYJVE9TCNMW/X/iP0FJ9WyNfNE5tcAAAAASUVORK5CYII="></div>
<div class="writings">
<div class="public_signal clearfix">
<h3>他的最新文章</h3>
<a href="http://blog.csdn.net/xiezhongtian" target="_blank" class="more"><span>更多文章</span></a>
</div>
<ul class="inf_list clearfix csdn-tracking-statistics tracking-click" data-mod="popu_382">
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/details/78971407" target="_blank">git 手记</a>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/details/78740342" target="_blank">安卓系统AOSP手记</a>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/details/78707521" target="_blank">linux内存管理概述（分段分页机制）</a>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/details/78489412" target="_blank">mysql开发技巧（一）</a>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/details/78458193" target="_blank">Springboot 属性配置（三）</a>
</li>
</ul>
</div>
<div class="user-hotArticle sort userSort">
<h3>文章分类</h3>
<ul class="hotArticle-list userSort-list" style="height: 160px; overflow-y: hidden;">
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/1749079" class="odd-overhidden floatL">interview</a>
<div class="read list-left floatR"><span>33篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/1776021" class="odd-overhidden floatL">c语言</a>
<div class="read list-left floatR"><span>17篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/1779723" class="odd-overhidden floatL">读深入Linux设备驱动程序内核机制</a>
<div class="read list-left floatR"><span>2篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/1786387" class="odd-overhidden floatL">物联网仓储管理项目之来世今生</a>
<div class="read list-left floatR"><span>2篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/1789623" class="odd-overhidden floatL">系统</a>
<div class="read list-left floatR"><span>10篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/1797069" class="odd-overhidden floatL">arm</a>
<div class="read list-left floatR"><span>7篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/1804629" class="odd-overhidden floatL">ccie之路</a>
<div class="read list-left floatR"><span>2篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/1822541" class="odd-overhidden floatL">算法训练</a>
<div class="read list-left floatR"><span>2篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/2509013" class="odd-overhidden floatL">national os</a>
<div class="read list-left floatR"><span>26篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/2611189" class="odd-overhidden floatL">php</a>
<div class="read list-left floatR"><span>1篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/5624373" class="odd-overhidden floatL">shell</a>
<div class="read list-left floatR"><span>2篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/5628747" class="odd-overhidden floatL">git</a>
<div class="read list-left floatR"><span>2篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/6044086" class="odd-overhidden floatL">Android</a>
<div class="read list-left floatR"><span>8篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/6048027" class="odd-overhidden floatL">linux</a>
<div class="read list-left floatR"><span>6篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/7021959" class="odd-overhidden floatL">saas</a>
<div class="read list-left floatR"><span>3篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/7086510" class="odd-overhidden floatL">devops</a>
<div class="read list-left floatR"><span>11篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/7092285" class="odd-overhidden floatL">golang</a>
<div class="read list-left floatR"><span>2篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/7124666" class="odd-overhidden floatL">Java基础及框架</a>
<div class="read list-left floatR"><span>10篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/7261240" class="odd-overhidden floatL">数据库</a>
<div class="read list-left floatR"><span>7篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/category/7262043" class="odd-overhidden floatL">mysql</a>
<div class="read list-left floatR"><span>7篇</span></div>
</li>
</ul>
<div class="unfold-btn">
<span>展开</span><i class="icon iconfont icon-xiajiantou"></i>
</div>
</div>
<!-- [StartShowSelfColumn]-->
<!-- [EndShowSelfColumn]-->
<div class="user-hotArticle sort timeSort">
<h3>文章存档</h3>
<ul class="hotArticle-list timeSort-list" style="height: 160px; overflow-y: hidden;">
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2018/01" class="odd-overhidden floatL">2018年1月</a>
<div class="read list-left floatR"><span>1篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2017/12" class="odd-overhidden floatL">2017年12月</a>
<div class="read list-left floatR"><span>3篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2017/11" class="odd-overhidden floatL">2017年11月</a>
<div class="read list-left floatR"><span>11篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2017/10" class="odd-overhidden floatL">2017年10月</a>
<div class="read list-left floatR"><span>6篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2017/09" class="odd-overhidden floatL">2017年9月</a>
<div class="read list-left floatR"><span>2篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2017/08" class="odd-overhidden floatL">2017年8月</a>
<div class="read list-left floatR"><span>13篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2017/07" class="odd-overhidden floatL">2017年7月</a>
<div class="read list-left floatR"><span>2篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2016/12" class="odd-overhidden floatL">2016年12月</a>
<div class="read list-left floatR"><span>2篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2016/11" class="odd-overhidden floatL">2016年11月</a>
<div class="read list-left floatR"><span>1篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2016/03" class="odd-overhidden floatL">2016年3月</a>
<div class="read list-left floatR"><span>1篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2016/01" class="odd-overhidden floatL">2016年1月</a>
<div class="read list-left floatR"><span>1篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2015/12" class="odd-overhidden floatL">2015年12月</a>
<div class="read list-left floatR"><span>6篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2015/08" class="odd-overhidden floatL">2015年8月</a>
<div class="read list-left floatR"><span>2篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2015/07" class="odd-overhidden floatL">2015年7月</a>
<div class="read list-left floatR"><span>7篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2015/06" class="odd-overhidden floatL">2015年6月</a>
<div class="read list-left floatR"><span>1篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2015/05" class="odd-overhidden floatL">2015年5月</a>
<div class="read list-left floatR"><span>1篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2014/12" class="odd-overhidden floatL">2014年12月</a>
<div class="read list-left floatR"><span>1篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2014/11" class="odd-overhidden floatL">2014年11月</a>
<div class="read list-left floatR"><span>3篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2014/10" class="odd-overhidden floatL">2014年10月</a>
<div class="read list-left floatR"><span>7篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2014/09" class="odd-overhidden floatL">2014年9月</a>
<div class="read list-left floatR"><span>6篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2014/08" class="odd-overhidden floatL">2014年8月</a>
<div class="read list-left floatR"><span>9篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2014/07" class="odd-overhidden floatL">2014年7月</a>
<div class="read list-left floatR"><span>10篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2014/06" class="odd-overhidden floatL">2014年6月</a>
<div class="read list-left floatR"><span>1篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2014/05" class="odd-overhidden floatL">2014年5月</a>
<div class="read list-left floatR"><span>3篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2014/04" class="odd-overhidden floatL">2014年4月</a>
<div class="read list-left floatR"><span>2篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2014/03" class="odd-overhidden floatL">2014年3月</a>
<div class="read list-left floatR"><span>12篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2014/02" class="odd-overhidden floatL">2014年2月</a>
<div class="read list-left floatR"><span>10篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2014/01" class="odd-overhidden floatL">2014年1月</a>
<div class="read list-left floatR"><span>3篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2013/12" class="odd-overhidden floatL">2013年12月</a>
<div class="read list-left floatR"><span>26篇</span></div>
</li>
<li class="clearfix">
<a href="http://blog.csdn.net/xiezhongtian/article/month/2013/11" class="odd-overhidden floatL">2013年11月</a>
<div class="read list-left floatR"><span>9篇</span></div>
</li>
</ul>
<div class="unfold-btn">
<span>展开</span><i class="icon iconfont icon-xiajiantou"></i>
</div>
</div>
<div class="user-hotArticle">
<h3>他的热门文章</h3>
<ul class="hotArticle-list csdn-tracking-statistics tracking-click" data-mod="popu_521">
<!-- [StartHotArticles]-->
<li>
<a href="http://blog.csdn.net/xiezhongtian/article/details/40040967" target="_blank">samba的使用smbclient命令</a>
<div class="read list-left"><i class="icon iconfont icon-read"></i><span>5124</span></div>
</li>
<li>
<a href="http://blog.csdn.net/xiezhongtian/article/details/50409431" target="_blank">andriod-x86 移植项目---获取源码</a>
<div class="read list-left"><i class="icon iconfont icon-read"></i><span>2744</span></div>
</li>
<li>
<a href="http://blog.csdn.net/xiezhongtian/article/details/46739827" target="_blank">linux配置打印机的一些整理</a>
<div class="read list-left"><i class="icon iconfont icon-read"></i><span>2553</span></div>
</li>
<li>
<a href="http://blog.csdn.net/xiezhongtian/article/details/38188055" target="_blank">进程的三个基本状态切换</a>
<div class="read list-left"><i class="icon iconfont icon-read"></i><span>2258</span></div>
</li>
<li>
<a href="http://blog.csdn.net/xiezhongtian/article/details/46754889" target="_blank">INFO: task ftest07:1247 blocked for more than 120 seconds 深入探索</a>
<div class="read list-left"><i class="icon iconfont icon-read"></i><span>1976</span></div>
</li>
<!-- [EndHotArticles]-->
</ul>
</div>
<!-- [startcustom]-->
<!-- [endcustom]-->
<div class="fixRight_box" style="height:256px">
<div class="fixRight">
<!-- 广告位：PC端-博客详情右侧视窗2（feed流）-300*300 -->
<script>
(function() {
var s = "_" + Math.random().toString(36).slice(2);
document.write('<div id="' + s + '"></div>');
(window.slotbydup=window.slotbydup || []).push({
id: '5384130',
container: s,
size: '300,300',
display: 'inlay-fix'
});
})();
</script><div id="_bhvlxpiuavq"></div><script charset="utf-8" src="http://pos.baidu.com/dcvm?di=5384130&dri=0&dis=0&dai=0&ps=3062x847&enu=encoding&dcb=___adblockplus&dtm=SSP_JSONP&dvi=0.0&dci=-1&dpt=none&tsr=0&tpr=1515590766342&ti=%E6%95%B4%E6%95%B0%E5%88%92%E5%88%86%E9%97%AE%E9%A2%98%E7%9A%84%E9%80%92%E5%BD%92%E7%AE%97%E6%B3%95-c%E8%AF%AD%E8%A8%80%20-%20CSDN%E5%8D%9A%E5%AE%A2&ari=2&dbv=0&drs=1&pcs=1008x582&pss=1160x3916&cfv=28&cpl=19&chi=1&cce=true&cec=UTF-8&tlm=1515590766&rw=598<u=http%3A%2F%2Fblog.csdn.net%2Fpunk_lover%2Farticle%2Fdetails%2F17797151<r=https%3A%2F%2Fwww.baidu.com%2Flink%3Furl%3DKc4IQ5p2hNu4oEzoH2zD6x3htcctMNir5Yj7AtTZdsMpILqVsVihJTMIqRNt0udsslI2SkA-rv8t_cLxMbzqTnDFHCmi3D_mqK9Q88ISePy%26wd%3D%26eqid%3Db88875b60000c859000000055a561261&lcr=https%3A%2F%2Fwww.baidu.com%2Flink%3Furl%3DKc4IQ5p2hNu4oEzoH2zD6x3htcctMNir5Yj7AtTZdsMpILqVsVihJTMIqRNt0udsslI2SkA-rv8t_cLxMbzqTnDFHCmi3D_mqK9Q88ISePy%26wd%3D%26eqid%3Db88875b60000c859000000055a561261&ecd=1&uc=1024x740&pis=-1x-1&sr=1024x768&tcn=1515590767"></script><div id="_9pecprru8s"><iframe scrolling="no" src="http://pos.baidu.com/s?hei=250&wid=300&di=u3163270<u=http%3A%2F%2Fblog.csdn.net%2Fpunk_lover%2Farticle%2Fdetails%2F17797151&tpr=1515590766762&pcs=1008x582&ccd=24&ant=0&cmi=36&psr=1024x768&dc=2&exps=111000&pis=-1x-1&col=zh-CN<r=https%3A%2F%2Fwww.baidu.com%2Flink%3Furl%3DKc4IQ5p2hNu4oEzoH2zD6x3htcctMNir5Yj7AtTZdsMpILqVsVihJTMIqRNt0udsslI2SkA-rv8t_cLxMbzqTnDFHCmi3D_mqK9Q88ISePy%26wd%3D%26eqid%3Db88875b60000c859000000055a561261&dri=0&dis=0&ps=3062x847&cce=true&par=1024x740&cfv=28&cec=UTF-8&cdo=-1&pss=1160x4066&cja=false&cpl=19&tlm=1515590769&tcn=1515590769&dtm=HTML_POST&drs=1&ari=2&ti=%E6%95%B4%E6%95%B0%E5%88%92%E5%88%86%E9%97%AE%E9%A2%98%E7%9A%84%E9%80%92%E5%BD%92%E7%AE%97%E6%B3%95-c%E8%AF%AD%E8%A8%80%20-%20CSDN%E5%8D%9A%E5%AE%A2&chi=1&dai=2" frameborder="0" height="250" width="300"></iframe></div><script type="text/javascript" src="//mpb1.iteye.com/avneunkwbycx.js"></script>
<div class="copyright csdn-tracking-statistics" data-mod="popu_475" data-dsm="post">
<h3 class="feed_new_tit"><span class="line"></span><span class="txt">联系我们</span></h3>
<ul class="feed_contact">
<li>
<a href="http://wpa.qq.com/msgrd?v=3&uin=2431299880&site=qq&menu=yes" target="_blank">
<span class="ico"><i class="icon iconfont icon-QQ"></i></span>
<span class="txt">网站客服</span>
</a>
</li>
<li class="clearfix">
<a href="http://e.weibo.com/csdnsupport/profile" target="_blank">
<span class="ico"><i class="icon iconfont icon-xinlang"></i></span>
<span class="txt">微博客服</span>
</a>
</li>
<li class="clearfix">
<a href="mailto:webmaster@csdn.net" target="_blank">
<span class="ico"><i class="icon iconfont icon-mail"></i></span>
<span class="txt">webmaster@csdn.net</span>
</a>
</li>
<li class="clearfix">
<span class="ico"><i class="icon iconfont icon-call"></i></span>
<span class="txt">400-660-0108</span>
</li>
</ul>
<div class="feed_copyright">
<p><a href="http://www.miibeian.gov.cn/" target="_blank">京ICP证09002463号</a></p>
<p><a href="http://www.csdn.net/company/about.html" target="_blank">关于</a>|<a href="http://www.csdn.net/company/recruit.html" target="_blank">招聘</a>|<a href="http://www.csdn.net/company/marketing.html" target="_blank">广告服务</a></p>
<p><img src="//feed.csdn.net/images/ali.png" alt="ali" title="ali"></p>
<p>Copyright © 1999-2018</p>
<p>CSDN.NET, All Rights Reserved</p>
</div>
</div>
</div>
</div>
</aside>
06-09
2029
2029
“相关推荐”对你有帮助么？
-
非常没帮助 -
没帮助 -
一般 -
有帮助 -
非常有帮助
提交
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
