function counts(article){
    article = article.trim().toUpperCase();
    var array = article.match(/[A-z]+/g);
    article = " "+array.join("  ")+" ";
    var max = 0,word,num = 0,maxword="";
    for(var i = 0; i < array.length; i++) {        
        word = new RegExp(" "+array[i]+" ",'g');
    num = article.match(word).length;
    if(num>max){
        max=num;
        maxword = array[i];
    }
   }
   console.log(maxword+" "+max);
}
counts("Age has reached the end of the beginning of a word. May be guilty in his seems to passing a lot of different life became the appearance of the same day;");

优质内容筛选与推荐>>
1、抓包工具（查看协议）
2、排序算法值归并排序
3、fio——IO基准测试
4、[LeetCode]Search in Rotated Sorted Array
5、无线客户端框架设计（3）：基类的设计（iOS篇）