<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>评论：如果用JS得到字符串中出现次数最多的字母</title>
	<atom:link href="http://www.planabc.net/2007/09/05/which_letter_most_times/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.planabc.net/2007/09/05/which_letter_most_times/</link>
	<description>落草为根—专注前端技术&#38;&#38;关注用户体验</description>
	<lastBuildDate>Mon, 15 Mar 2010 14:10:42 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>来自：快乐笛子</title>
		<link>http://www.planabc.net/2007/09/05/which_letter_most_times/comment-page-1/#comment-33</link>
		<dc:creator>快乐笛子</dc:creator>
		<pubDate>Mon, 03 Mar 2008 13:21:06 +0000</pubDate>
		<guid isPermaLink="false">http://www.planabc.net/2007/09/05/which_letter_most_times/#comment-33</guid>
		<description>var str =&quot;adadfdfseffserfefsefseeffffftsdg&quot;;
var arr = str.split(&quot;&quot;);
var obj = {};
var objArr = [];
for(var i=0,j; j=arr[i]; i++){
	if(!obj[j])obj[j]=0;
	objArr[++obj[j]]=j;
}
alert(objArr[objArr.length-1]+&quot;==&quot;+(objArr.length-1));

希望能交换链接~，谢谢</description>
		<content:encoded><![CDATA[<p>var str =&#8221;adadfdfseffserfefsefseeffffftsdg&#8221;;<br />
var arr = str.split(&#8220;&#8221;);<br />
var obj = {};<br />
var objArr = [];<br />
for(var i=0,j; j=arr[i]; i++){<br />
	if(!obj[j])obj[j]=0;<br />
	objArr[++obj[j]]=j;<br />
}<br />
alert(objArr[objArr.length-1]+&#8221;==&#8221;+(objArr.length-1));</p>
<p>希望能交换链接~，谢谢</p>
]]></content:encoded>
	</item>
</channel>
</rss>
