﻿<?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++博客-ifeng-随笔分类-C/C++</title><link>http://www.cppblog.com/ifeng/category/17050.html</link><description /><language>zh-cn</language><lastBuildDate>Sat, 31 Dec 2011 05:29:06 GMT</lastBuildDate><pubDate>Sat, 31 Dec 2011 05:29:06 GMT</pubDate><ttl>60</ttl><item><title>C++变量命名规范</title><link>http://www.cppblog.com/ifeng/archive/2011/12/31/163252.html</link><dc:creator>冷锋</dc:creator><author>冷锋</author><pubDate>Sat, 31 Dec 2011 05:23:00 GMT</pubDate><guid>http://www.cppblog.com/ifeng/archive/2011/12/31/163252.html</guid><wfw:comment>http://www.cppblog.com/ifeng/comments/163252.html</wfw:comment><comments>http://www.cppblog.com/ifeng/archive/2011/12/31/163252.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/ifeng/comments/commentRss/163252.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/ifeng/services/trackbacks/163252.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: （转载自http://blog.csdn.net/huayehanshan/article/details/3860363）在软件开发过程中，代码的命名规范是一项很突出的内容。一套定义完整、结构清晰明了的命名规范将大大提升源代码的可读性和软件的可维护性。据考证，没有一种命名规则可以让所有的程序员都满意，程序设计教科书一般也不会指定命名规则。但是制定一套令开发组成员基本满意的命名规则，并在项目中贯彻...&nbsp;&nbsp;<a href='http://www.cppblog.com/ifeng/archive/2011/12/31/163252.html'>阅读全文</a><img src ="http://www.cppblog.com/ifeng/aggbug/163252.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/ifeng/" target="_blank">冷锋</a> 2011-12-31 13:23 <a href="http://www.cppblog.com/ifeng/archive/2011/12/31/163252.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Google C++ 风格指南</title><link>http://www.cppblog.com/ifeng/archive/2011/12/31/163244.html</link><dc:creator>冷锋</dc:creator><author>冷锋</author><pubDate>Sat, 31 Dec 2011 03:12:00 GMT</pubDate><guid>http://www.cppblog.com/ifeng/archive/2011/12/31/163244.html</guid><wfw:comment>http://www.cppblog.com/ifeng/comments/163244.html</wfw:comment><comments>http://www.cppblog.com/ifeng/archive/2011/12/31/163244.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/ifeng/comments/commentRss/163244.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/ifeng/services/trackbacks/163244.html</trackback:ping><description><![CDATA[<div><a href="http://codinn.com/projects/google-cpp-styleguide/view/headers.html#define">http://codinn.com/projects/google-cpp-styleguide/view/headers.html#define</a></div><img src ="http://www.cppblog.com/ifeng/aggbug/163244.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/ifeng/" target="_blank">冷锋</a> 2011-12-31 11:12 <a href="http://www.cppblog.com/ifeng/archive/2011/12/31/163244.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>在英文字符串中找第一个最长不含重复字符的子串高效实现（修改版）</title><link>http://www.cppblog.com/ifeng/archive/2011/10/18/158631.html</link><dc:creator>冷锋</dc:creator><author>冷锋</author><pubDate>Tue, 18 Oct 2011 12:39:00 GMT</pubDate><guid>http://www.cppblog.com/ifeng/archive/2011/10/18/158631.html</guid><wfw:comment>http://www.cppblog.com/ifeng/comments/158631.html</wfw:comment><comments>http://www.cppblog.com/ifeng/archive/2011/10/18/158631.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/ifeng/comments/commentRss/158631.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/ifeng/services/trackbacks/158631.html</trackback:ping><description><![CDATA[找工时候练习写的代码。翻出来了。<br />今天有朋友指出来程序运行结果错误，试了下，果然有问题，在下班途中重新整理了思路，修改了代码，整体思路不变，就是加了几行代码，处理字符串的最后部分。求验证结果。<br />顺便问下，怎么取消文章被评论时收到系统通知的邮件呢？<br /><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"><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #0000FF; ">char</span><span style="color: #000000; ">*</span><span style="color: #000000; ">GetSubStr(&nbsp;</span><span style="color: #0000FF; ">const</span><span style="color: #000000; ">&nbsp;</span><span style="color: #0000FF; ">char</span><span style="color: #000000; ">*</span><span style="color: #000000; ">str&nbsp;)<br />{<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;hash[</span><span style="color: #000000; ">256</span><span style="color: #000000; ">];&nbsp;</span><span style="color: #008000; ">//</span><span style="color: #008000; ">hash记录每个字符的出现位置</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;i;<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">for</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; ">;i</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">256</span><span style="color: #000000; ">;i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">&nbsp;)<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;hash[i]</span><span style="color: #000000; ">=-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;CurrentStart</span><span style="color: #000000; ">=</span><span style="color: #000000; ">0</span><span style="color: #000000; ">,MaxStart</span><span style="color: #000000; ">=</span><span style="color: #000000; ">0</span><span style="color: #000000; ">,MaxEnd</span><span style="color: #000000; ">=</span><span style="color: #000000; ">0</span><span style="color: #000000; ">,MaxLength&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">0</span><span style="color: #000000; ">,CurrentLength&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">,strLen&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;strlen(str);<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">(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; ">strLen;i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<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; ">(CurrentStart</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">hash[str[i]])&nbsp;</span><span style="color: #008000; ">//</span><span style="color: #008000; ">如果没有重复</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;hash[str[i]]</span><span style="color: #000000; ">=</span><span style="color: #000000; ">i;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<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;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;CurrentLength</span><span style="color: #000000; ">=</span><span style="color: #000000; ">i</span><span style="color: #000000; ">-</span><span style="color: #000000; ">CurrentStart;&nbsp;</span><span style="color: #008000; ">//</span><span style="color: #008000; ">当前长度</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(CurrentLength</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">MaxEnd</span><span style="color: #000000; ">-</span><span style="color: #000000; ">MaxStart)</span><span style="color: #008000; ">//</span><span style="color: #008000; ">如果当前长度最长</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">&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;MaxEnd</span><span style="color: #000000; ">=</span><span style="color: #000000; ">i;&nbsp;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;MaxStart</span><span style="color: #000000; ">=</span><span style="color: #000000; ">CurrentStart;<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;CurrentStart</span><span style="color: #000000; ">=</span><span style="color: #000000; ">hash[str[i]]</span><span style="color: #000000; ">+</span><span style="color: #000000; ">1</span><span style="color: #000000; ">;&nbsp;</span><span style="color: #008000; ">//</span><span style="color: #008000; ">更新当前最长的起点</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;hash[str[i]]</span><span style="color: #000000; ">=</span><span style="color: #000000; ">i;&nbsp;</span><span style="color: #008000; ">//</span><span style="color: #008000; ">更新字符出现的位置</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #008000; ">//</span><span style="color: #008000; ">增加的代码</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(&nbsp;strLen&nbsp;</span><span style="color: #000000; ">-</span><span style="color: #000000; ">&nbsp;CurrentStart</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">&nbsp;CurrentLength)<br />&nbsp;&nbsp;&nbsp;&nbsp;{<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;MaxEnd&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;strLen;<br />&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;MaxStart</span><span style="color: #000000; ">=</span><span style="color: #000000; ">CurrentStart;<br />&nbsp;&nbsp;&nbsp;&nbsp;}<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #008000; ">//<br /></span><span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;MaxLength</span><span style="color: #000000; ">=</span><span style="color: #000000; ">MaxEnd</span><span style="color: #000000; ">-</span><span style="color: #000000; ">MaxStart;<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">char</span><span style="color: #000000; ">*</span><span style="color: #000000; ">reStr&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; ">char</span><span style="color: #000000; ">[MaxLength</span><span style="color: #000000; ">+</span><span style="color: #000000; ">1</span><span style="color: #000000; ">];<br />&nbsp;&nbsp;&nbsp;&nbsp;reStr[MaxLength]</span><span style="color: #000000; ">=</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />&nbsp;&nbsp;&nbsp;&nbsp;memcpy(&nbsp;reStr,str</span><span style="color: #000000; ">+</span><span style="color: #000000; ">MaxStart,MaxLength&nbsp;);<br />&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;reStr;<br />}</span></div><br /><br /><br /><img src ="http://www.cppblog.com/ifeng/aggbug/158631.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/ifeng/" target="_blank">冷锋</a> 2011-10-18 20:39 <a href="http://www.cppblog.com/ifeng/archive/2011/10/18/158631.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>