CodeWars Most frequently used words in a text

Most frequently used words in a text【javaScript】

题目描述
Write a function that, given a string of text (possibly with punctuation and line-breaks), returns an array of the top-3 most occurring words, in descending order of the number of occurrences.

Assumptions:
A word is a string of letters (A to Z) optionally containing one or more apostrophes (’) in ASCII.
Apostrophes can appear at the start, middle or end of a word (‘abc, abc’, ‘abc’, ab’c are all valid)
Any other characters (e.g. #, , / , . …) are not part of a word and should be treated as whitespace.
Matches should be case-insensitive, and the words in the result should be lowercased.
Ties may be broken arbitrarily.
If a text contains fewer than three unique words, then either the top-2 or top-1 words should be returned, or an empty array if a text contains no words.
样例
代码

function topThreeWords(text) {
	// 记录次数
    let cache = {};
    let arr = text.toLowerCase().replace(/[^a-zA-z\s']/g, '').split(' ').filter(item => item && item !== "'");
    // 统计出现次数
    arr.forEach(item => {
        cache[item] = (cache[item] || 0) + 1;
    });
    // 去重并降序排列
    arr = Array.from(new Set(arr)).sort((e1, e2) => cache[e2] - cache[e1]);
    return arr.splice(0, 3);
}
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值