SelectWords
by THR jimmy
Babel + JSX
"use strict";
//数组是否包含指定元素
Array.prototype.contains = function(suArr) {
for (var i = 0, len = this.length; i < len; i++) {
if (this[i] == suArr) {
return true;
}
}
return false;
}
//不重复元素构成的数组
Array.prototype.uniquelize = function() {
var ra = new Array();
for (var i = 0, len = this.length; i < len; i++) {
if (!ra.contains(this[i])) {
ra.push(this[i]);
}
}
return ra;
};
/*
* 找出单词数的代码
*/
var findWord = {
//找出文章中出现最大的单词数
maxword:[], //保存文章单词和出现的频率
counts(article) { //筛选文章中单词的频率
article = article.trim().toLowerCase();
let array = article.match(/[a-z]+/g), //获取文章中,所有的单词。不包括简写: it's.
test = array.uniquelize(); //获取不重复的元素
article = "-" + array.join("--") + "-"; //将所有单词数重组
let max = 0,
word, num = 0,
maxword = [];
/*
* 遍历不重复单词,并得出出现的次数
*/
for (let i = 0,len = test.length; i <len ; i++) {
word = new RegExp("-" + test[i] + "-", 'g');
num = article.match(word).length; //筛选单词数
maxword.push({
num: num,
word: test[i]
})
}
this.maxword = maxword; //保存筛选结果
},
/*
* 通过得出的单词数的频率和出现的结果数,输出最大出现次数的单词
*/
get(article){
this.counts(article);
let maxword = this.maxword,
max = Math.max.apply(null, maxword.map((val) => {
return val.num
}));
maxword.forEach((val)=>{
if (val.num === max) console.log(val.word);
})
}
}
//测试代码
var time1 = new Date().getTime();
var article = "fdsafs. by Jonatas Stevam; 1 video; 5 views; Last updated on Aug 5, Aug,Aug, 2007. trewtyrw. Play all. Share. Loading... Save. Sign in to YouTube. Sign in. Play next; Play ...";
findWord.get(article);
console.log(new Date().getTime() - time1);
//可以得出代码运行的时间: 我这里是15ms. 由于测试用例太短所以时间的长短不明显。