﻿<?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>博客园-JACKY-最新评论</title><link>http://www.cnblogs.com/jacky0952/CommentsRSS.aspx</link><description>  不自见，故明；不自是，故彰；不自伐，故有功；不自矜；故长；夫唯不争，故天下莫能与之争。</description><language>zh-cn</language><pubDate>Tue, 25 Aug 2009 06:56:48 GMT</pubDate><lastBuildDate>Tue, 25 Aug 2009 06:56:48 GMT</lastBuildDate><generator>cnblogs</generator><item><title>Re:替朋友发几则招聘信息,找工作的朋友可以看看 呵呵</title><link>http://www.cnblogs.com/jacky0952/archive/2010/08/07/286264.html#1888945</link><dc:creator>无忧植物液</dc:creator><author>无忧植物液</author><pubDate>Sat, 07 Aug 2010 03:59:32 GMT</pubDate><guid>http://www.cnblogs.com/jacky0952/archive/2010/08/07/286264.html#1888945</guid><description><![CDATA[搭个顺风车！
我公司运营大型网购门户型网站，近期需要改版，大量图片修改，表单制作工作，
现招聘兼职程序员和网站美工，也可外包给小型网络公司
程序员：要求可独立编写ASP代码，可制作ASP表单
美工：精通PS  dIV+cSS   可以处理浏览器兼容问题

工资周结，每周50-500不等，按工作量计工资

公司产品：无忧植物液
现运营网站：http://www.wuyouzhiwuye.com （网站仅供求职者参考，严禁盗窃信息）
联系人：曾言

QQ：1102869914<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/jacky0952/" target="_blank">无忧植物液</a> 2010-08-07 11:59 <a href="http://www.cnblogs.com/jacky0952/archive/2010/08/07/286264.html#1888945#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:基于深度优先搜索的蜘蛛程序</title><link>http://www.cnblogs.com/jacky0952/archive/2010/01/08/1533132.html#1742562</link><dc:creator>Matol Poet</dc:creator><author>Matol Poet</author><pubDate>Fri, 08 Jan 2010 03:07:39 GMT</pubDate><guid>http://www.cnblogs.com/jacky0952/archive/2010/01/08/1533132.html#1742562</guid><description><![CDATA[
我强烈支持！

我的邮箱：kewen_vip@163.com<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/jacky0952/" target="_blank">Matol Poet</a> 2010-01-08 11:07 <a href="http://www.cnblogs.com/jacky0952/archive/2010/01/08/1533132.html#1742562#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:关于string的indexof方法的试验</title><link>http://www.cnblogs.com/jacky0952/archive/2009/08/28/1545934.html#1628153</link><dc:creator>沧海一声笑</dc:creator><author>沧海一声笑</author><pubDate>Fri, 28 Aug 2009 02:28:20 GMT</pubDate><guid>http://www.cnblogs.com/jacky0952/archive/2009/08/28/1545934.html#1628153</guid><description><![CDATA[ 这个算法有经典的KMP 
  愚昧了1<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/jacky0952/" target="_blank">沧海一声笑</a> 2009-08-28 10:28 <a href="http://www.cnblogs.com/jacky0952/archive/2009/08/28/1545934.html#1628153#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:关于字符串效率问题</title><link>http://www.cnblogs.com/jacky0952/archive/2009/08/26/1545677.html#1626012</link><dc:creator>沧海一声笑</dc:creator><author>沧海一声笑</author><pubDate>Wed, 26 Aug 2009 06:00:07 GMT</pubDate><guid>http://www.cnblogs.com/jacky0952/archive/2009/08/26/1545677.html#1626012</guid><description><![CDATA[@eaglet
ok<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/jacky0952/" target="_blank">沧海一声笑</a> 2009-08-26 14:00 <a href="http://www.cnblogs.com/jacky0952/archive/2009/08/26/1545677.html#1626012#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:关于字符串效率问题</title><link>http://www.cnblogs.com/jacky0952/archive/2009/08/26/1545677.html#1625694</link><dc:creator>eaglet</dc:creator><author>eaglet</author><pubDate>Wed, 26 Aug 2009 02:16:21 GMT</pubDate><guid>http://www.cnblogs.com/jacky0952/archive/2009/08/26/1545677.html#1625694</guid><description><![CDATA[如果是取字串，比如类似 indexof 则通常是使用KMP 算法。<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/jacky0952/" target="_blank">eaglet</a> 2009-08-26 10:16 <a href="http://www.cnblogs.com/jacky0952/archive/2009/08/26/1545677.html#1625694#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:关于字符串效率问题</title><link>http://www.cnblogs.com/jacky0952/archive/2009/08/25/1545677.html#1624671</link><dc:creator>沧海一声笑</dc:creator><author>沧海一声笑</author><pubDate>Tue, 25 Aug 2009 01:22:59 GMT</pubDate><guid>http://www.cnblogs.com/jacky0952/archive/2009/08/25/1545677.html#1624671</guid><description><![CDATA[@eaglet
我看了一下，你这里主要是利用字符与ASCII编码的关系，够造一线性数组取得定位的优势，我是用哈希表。具体这个问题 你这种方法快，如果涉及比如字符串字串的问题，估计还得有哈希快一点，呵呵。<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/jacky0952/" target="_blank">沧海一声笑</a> 2009-08-25 09:22 <a href="http://www.cnblogs.com/jacky0952/archive/2009/08/25/1545677.html#1624671#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:关于字符串效率问题</title><link>http://www.cnblogs.com/jacky0952/archive/2009/08/23/1545677.html#1623026</link><dc:creator>eaglet</dc:creator><author>eaglet</author><pubDate>Sun, 23 Aug 2009 01:23:08 GMT</pubDate><guid>http://www.cnblogs.com/jacky0952/archive/2009/08/23/1545677.html#1623026</guid><description><![CDATA[你的代码中有太多影响效率的地方，我该了一下

            char maxChar = (char)0;
            int max = 0;

            int[] hashBytes = new int [256];


            foreach (char c in str)
            {
                hashBytes[c]++;
                if (max &lt; hashBytes[c])
                {
                    maxChar = c;
                    max = hashBytes[c];
                }
            }

大概比你这个快5倍左右。
<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/jacky0952/" target="_blank">eaglet</a> 2009-08-23 09:23 <a href="http://www.cnblogs.com/jacky0952/archive/2009/08/23/1545677.html#1623026#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:关于字符串效率问题</title><link>http://www.cnblogs.com/jacky0952/archive/2009/08/20/1545677.html#1620977</link><dc:creator>沧海一声笑</dc:creator><author>沧海一声笑</author><pubDate>Thu, 20 Aug 2009 08:43:24 GMT</pubDate><guid>http://www.cnblogs.com/jacky0952/archive/2009/08/20/1545677.html#1620977</guid><description><![CDATA[@lucien

  其实，这个问题就用了个直接寻址的方法，压根没用上哈希函数！
我的哈希表中就存储的字母和频率！~<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/jacky0952/" target="_blank">沧海一声笑</a> 2009-08-20 16:43 <a href="http://www.cnblogs.com/jacky0952/archive/2009/08/20/1545677.html#1620977#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:关于字符串效率问题</title><link>http://www.cnblogs.com/jacky0952/archive/2009/08/19/1545677.html#1620123</link><dc:creator>lucien</dc:creator><author>lucien</author><pubDate>Wed, 19 Aug 2009 15:05:27 GMT</pubDate><guid>http://www.cnblogs.com/jacky0952/archive/2009/08/19/1545677.html#1620123</guid><description><![CDATA[你统计的是字母的频率，可以把hashtable换成数据，效率会更高一些<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/jacky0952/" target="_blank">lucien</a> 2009-08-19 23:05 <a href="http://www.cnblogs.com/jacky0952/archive/2009/08/19/1545677.html#1620123#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Re:关于字符串效率问题</title><link>http://www.cnblogs.com/jacky0952/archive/2009/08/17/1545677.html#1616267</link><dc:creator>沧海一声笑</dc:creator><author>沧海一声笑</author><pubDate>Sun, 16 Aug 2009 16:24:46 GMT</pubDate><guid>http://www.cnblogs.com/jacky0952/archive/2009/08/17/1545677.html#1616267</guid><description><![CDATA[@JoeWang
字符多的话 性能会很差，你可以试试<br><br><div align=right><a style="text-decoration:none;" href="http://www.cnblogs.com/jacky0952/" target="_blank">沧海一声笑</a> 2009-08-17 00:24 <a href="http://www.cnblogs.com/jacky0952/archive/2009/08/17/1545677.html#1616267#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>
