- html - 出于某种原因,IE8 对我的 Sass 文件中继承的 html5 CSS 不友好?
- JMeter 在响应断言中使用 span 标签的问题
- html - 在 :hover and :active? 上具有不同效果的 CSS 动画
- html - 相对于居中的 html 内容固定的 CSS 重复背景?
描述:
getMostPopularAuthors
返回一个包含五个或更少对象的数组,这些对象代表最受欢迎的作者,他们的书被 checkout 次数最多。受欢迎程度的表示方法是找到作者所写的所有书籍,然后将这些书籍被借阅的次数相加。
函数有两个参数,顺序如下:
返回数组中的每个对象都有两个键:
name
键。count
键,代表作者的书被借阅的次数。如果出现的作者超过五位,则只返回前五名。
注意:
我可以解决答案的第二部分,但我在解决第一部分问题。我知道它想访问 author.js
文件,但它也想访问 books.js
文件,我不知道如何实现和访问 author.js
数据.
这是 author.js
文件数据的一部分:
const authors = [
{
id: 0,
name: {
first: "Lucia",
last: "Moreno",
},
},
{
id: 1,
name: {
first: "Trisha",
last: "Mathis",
},
},
{
id: 2,
name: {
first: "Arnold",
last: "Marks",
},
},
{
id: 3,
name: {
first: "Faye",
last: "Arnold",
},
},
{
id: 4,
name: {
first: "Tami",
last: "Hurst",
},
},
{
id: 5,
name: {
first: "Farmer",
last: "Stevenson",
},
},
{
id: 6,
name: {
first: "Hancock",
last: "Fuller",
},
},
{
id: 7,
name: {
first: "Ila",
last: "Reid",
},
},
{
id: 8,
name: {
first: "Susanne",
last: "Lawson",
},
}
]
这是 book.js
文件数据的一部分:
const books = [
{
id: "5f447132d487bd81da01e25e",
title: "sit eiusmod occaecat eu magna",
genre: "Science",
authorId: 8,
borrows: [
{
id: "5f446f2e2cfa3e1d234679b9",
returned: false,
},
{
id: "5f446f2ed3609b719568a415",
returned: true,
},
{
id: "5f446f2e1c71888e2233621e",
returned: true,
},
{
id: "5f446f2e6059326d9feb9a68",
returned: true,
},
{
id: "5f446f2ede05a0b1e3394d8b",
returned: true,
},
{
id: "5f446f2e4081699cdc6a2735",
returned: true,
},
{
id: "5f446f2e3900dfec59489477",
returned: true,
},
{
id: "5f446f2e6059326d9feb9a68",
returned: true,
},
{
id: "5f446f2e409f8883af2955dd",
returned: true,
},
{
id: "5f446f2e3900dfec59489477",
returned: true,
},
{
id: "5f446f2eae901a82e0259947",
returned: true,
},
{
id: "5f446f2ef2ab5f5a9f60c4f2",
returned: true,
},
{
id: "5f446f2ea6b68cf6f85f6e28",
returned: true,
},
{
id: "5f446f2eed18105706d6ca19",
returned: true,
},
{
id: "5f446f2eae901a82e0259947",
returned: true,
},
{
id: "5f446f2e91c2af00cb74e82b",
returned: true,
},
{
id: "5f446f2e5aa2bb5545a0f8a6",
returned: true,
},
{
id: "5f446f2ea508b6a99c3e42c6",
returned: true,
},
{
id: "5f446f2e50cc2da9cd80efdb",
returned: true,
},
{
id: "5f446f2e0b3e2ff72fc503e7",
returned: true,
},
{
id: "5f446f2e91c2af00cb74e82b",
returned: true,
},
{
id: "5f446f2ef795e593cd3cd19d",
returned: true,
},
{
id: "5f446f2e2f35653fa80bf490",
returned: true,
},
{
id: "5f446f2e7b9cd304fed3a8bc",
returned: true,
},
{
id: "5f446f2ed9aac23c0340aab2",
returned: true,
},
],
},
{
id: "5f4471329627160be1e8ce92",
title: "esse ea veniam non occaecat",
genre: "Classics",
authorId: 10,
borrows: [
{
id: "5f446f2ed3609b719568a415",
returned: false,
},
{
id: "5f446f2ec32d71dabec35b06",
returned: true,
},
{
id: "5f446f2ef2ab5f5a9f60c4f2",
returned: true,
},
{
id: "5f446f2e7a1be21e362b82f9",
returned: true,
},
{
id: "5f446f2e6059326d9feb9a68",
returned: true,
},
{
id: "5f446f2ec32d71dabec35b06",
returned: true,
},
{
id: "5f446f2e59f9380a1d03d766",
returned: true,
},
{
id: "5f446f2e141b97d842b680fd",
returned: true,
},
{
id: "5f446f2e409f8883af2955dd",
returned: true,
},
{
id: "5f446f2ee176f80b8d5d24da",
returned: true,
},
{
id: "5f446f2ef795e593cd3cd19d",
returned: true,
},
{
id: "5f446f2eef419207c5fa4ec9",
returned: true,
},
{
id: "5f446f2e50cc2da9cd80efdb",
returned: true,
},
{
id: "5f446f2e4081699cdc6a2735",
returned: true,
},
],
},
{
id: "5f44713265e5d8d17789beb0",
title: "tempor occaecat fugiat",
genre: "Travel",
authorId: 16,
borrows: [
{
id: "5f446f2e4eff1030e7316861",
returned: true,
},
{
id: "5f446f2ecc5c4787c403f844",
returned: true,
},
{
id: "5f446f2ee1661e64cde14e55",
returned: true,
},
{
id: "5f446f2e50cc2da9cd80efdb",
returned: true,
},
{
id: "5f446f2ef795e593cd3cd19d",
returned: true,
},
{
id: "5f446f2eae901a82e0259947",
returned: true,
},
{
id: "5f446f2e3e70bb4e1ab821c9",
returned: true,
},
{
id: "5f446f2ef2ab5f5a9f60c4f2",
returned: true,
},
{
id: "5f446f2e136866e4fe60c893",
returned: true,
},
],
},
]
这是我尝试过的:
function getMostPopularAuthors(books, authors) {
const authorPopularity = books.map((book) => book.authorId);
const temp = [];
authorPopularity.map((authorId) => {
const borrowLocation = temp.findIndex((element) => element.name === authorId);
if (borrowLocation >= 0) {
temp[borrowLocation].count = temp[borrowLocation].count + 1;
} else {
temp.push({ name: authorId, count: 1 });
}
});
temp.sort((alpha, delta) => delta.count - alpha.count);
if (temp.length > 5) {
return temp.slice(0, 5);
}
return temp;
}
此外,如果有人想要引用测试代码,请在此处:
describe("getMostPopularAuthors()", () => {
it("should return an ordered list of most popular authors", () => {
const actual = getMostPopularAuthors(books, authors);
const [first, second] = [
{ name: "Susanne Lawson", count: 11 },
{ name: "Matthews Sanders", count: 5 },
];
expect(actual[0]).to.eql(first);
expect(actual[1]).to.eql(second);
});
it("should limit the list to the top five", () => {
const actual = getMostPopularAuthors(books, authors);
expect(actual.length).to.equal(5);
});});});
最佳答案
您可以 map() 作者数组并使用 filter() 找到该作者的所有书籍。对于计数,您可以使用 reduce 将每个作者借用数组的长度加在一起。
function getPopularAuthors(authorArray, booksArray, total) {
return authorArray.map(a => {
// loop through the author array
a.count = booksArray.filter(b => b.authorId === a.id).reduce((b, a) => b + (a.borrows && a.borrows.length || 0), 0);
// to get the count, filter the book array and then reduce it to a sum of all matching books borrows array length
a.name = `${a.name.first} ${a.name.last}`;
delete a.id
// remove the id since that isn't part of the desired result
return a
}).sort((a, b) => b.count - a.count).slice(0, total)
// sort the end result to be biggest counts first, then slice the array down to the desired length
}
const authors = [{
id: 0,
name: {
first: "Lucia",
last: "Moreno",
},
},
{
id: 1,
name: {
first: "Trisha",
last: "Mathis",
},
},
{
id: 2,
name: {
first: "Arnold",
last: "Marks",
},
},
{
id: 3,
name: {
first: "Faye",
last: "Arnold",
},
},
{
id: 4,
name: {
first: "Tami",
last: "Hurst",
},
},
{
id: 5,
name: {
first: "Farmer",
last: "Stevenson",
},
},
{
id: 16,
name: {
first: "Hancock",
last: "Fuller",
},
},
{
id: 7,
name: {
first: "Ila",
last: "Reid",
},
},
{
id: 8,
name: {
first: "Susanne",
last: "Lawson",
},
}
]
const books = [{
id: "test",
title: "Test with no borrows",
genre: "Science",
authorId: 8},
{
id: "5f447132d487bd81da01e25e",
title: "sit eiusmod occaecat eu magna",
genre: "Science",
authorId: 8,
borrows: [{
id: "5f446f2e2cfa3e1d234679b9",
returned: false,
},
{
id: "5f446f2ed3609b719568a415",
returned: true,
},
{
id: "5f446f2e1c71888e2233621e",
returned: true,
},
{
id: "5f446f2e6059326d9feb9a68",
returned: true,
},
{
id: "5f446f2ede05a0b1e3394d8b",
returned: true,
},
{
id: "5f446f2e4081699cdc6a2735",
returned: true,
},
{
id: "5f446f2e3900dfec59489477",
returned: true,
},
{
id: "5f446f2e6059326d9feb9a68",
returned: true,
},
{
id: "5f446f2e409f8883af2955dd",
returned: true,
},
{
id: "5f446f2e3900dfec59489477",
returned: true,
},
{
id: "5f446f2eae901a82e0259947",
returned: true,
},
{
id: "5f446f2ef2ab5f5a9f60c4f2",
returned: true,
},
{
id: "5f446f2ea6b68cf6f85f6e28",
returned: true,
},
{
id: "5f446f2eed18105706d6ca19",
returned: true,
},
{
id: "5f446f2eae901a82e0259947",
returned: true,
},
{
id: "5f446f2e91c2af00cb74e82b",
returned: true,
},
{
id: "5f446f2e5aa2bb5545a0f8a6",
returned: true,
},
{
id: "5f446f2ea508b6a99c3e42c6",
returned: true,
},
{
id: "5f446f2e50cc2da9cd80efdb",
returned: true,
},
{
id: "5f446f2e0b3e2ff72fc503e7",
returned: true,
},
{
id: "5f446f2e91c2af00cb74e82b",
returned: true,
},
{
id: "5f446f2ef795e593cd3cd19d",
returned: true,
},
{
id: "5f446f2e2f35653fa80bf490",
returned: true,
},
{
id: "5f446f2e7b9cd304fed3a8bc",
returned: true,
},
{
id: "5f446f2ed9aac23c0340aab2",
returned: true,
},
],
},
{
id: "5f4471329627160be1e8ce92",
title: "esse ea veniam non occaecat",
genre: "Classics",
authorId: 10,
borrows: [{
id: "5f446f2ed3609b719568a415",
returned: false,
},
{
id: "5f446f2ec32d71dabec35b06",
returned: true,
},
{
id: "5f446f2ef2ab5f5a9f60c4f2",
returned: true,
},
{
id: "5f446f2e7a1be21e362b82f9",
returned: true,
},
{
id: "5f446f2e6059326d9feb9a68",
returned: true,
},
{
id: "5f446f2ec32d71dabec35b06",
returned: true,
},
{
id: "5f446f2e59f9380a1d03d766",
returned: true,
},
{
id: "5f446f2e141b97d842b680fd",
returned: true,
},
{
id: "5f446f2e409f8883af2955dd",
returned: true,
},
{
id: "5f446f2ee176f80b8d5d24da",
returned: true,
},
{
id: "5f446f2ef795e593cd3cd19d",
returned: true,
},
{
id: "5f446f2eef419207c5fa4ec9",
returned: true,
},
{
id: "5f446f2e50cc2da9cd80efdb",
returned: true,
},
{
id: "5f446f2e4081699cdc6a2735",
returned: true,
},
],
},
{
id: "5f44713265e5d8d17789beb0",
title: "tempor occaecat fugiat",
genre: "Travel",
authorId: 16,
borrows: [{
id: "5f446f2e4eff1030e7316861",
returned: true,
},
{
id: "5f446f2ecc5c4787c403f844",
returned: true,
},
{
id: "5f446f2ee1661e64cde14e55",
returned: true,
},
{
id: "5f446f2e50cc2da9cd80efdb",
returned: true,
},
{
id: "5f446f2ef795e593cd3cd19d",
returned: true,
},
{
id: "5f446f2eae901a82e0259947",
returned: true,
},
{
id: "5f446f2e3e70bb4e1ab821c9",
returned: true,
},
{
id: "5f446f2ef2ab5f5a9f60c4f2",
returned: true,
},
{
id: "5f446f2e136866e4fe60c893",
returned: true,
},
],
}
]
function getPopularAuthors(authorArray, booksArray, total) {
return authorArray.map(a => {
a.count = booksArray.filter(b => b.authorId === a.id).reduce((b, a) => b + (a.borrows && a.borrows.length || 0), 0);
a.name = `${a.name.first} ${a.name.last}`;
delete a.id;
return a;
}).sort((a, b) => b.count - a.count).slice(0, total)
}
console.log(getPopularAuthors(authors, books, 5))
关于javascript - 如何按流行度从数组中获取前五个对象,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/68474133/
前一段时间写过一篇文章《 实战,一个高扩展、可视化低代码前端,详实、完整 》,得到了很多朋友的关注。 其中的逻辑编排部分过于简略,不少朋友希望能写一些关于逻辑编排的内容,本文就详细讲述一下逻辑
我正在尝试以下 Java 片段: int[] testArray={10,20,30,40}; int i= 0; testArray[i++]= testArray[i++]+1; System.o
我想知道我是否可以通过某种方式在 C++ 中进行前/后函数调用。我有一个包含很多函数的包装器类,在每次调用包装器函数后,我应该调用另一个始终相同的函数。 所以我不想像这样对每个函数调用 postFun
我有一个像这样的头文件: #pragma once #include "gamestate.h" #include "ExitListener.h" class InitialGameState :
学习左值和右值。定义是任何可以是“地址”的东西都是左值,否则就是右值。 我检查了运算符的优先级,前缀和后缀增量都比“地址”运算符具有更高的优先级。 对于下面的两个例子,谁能解释一下为什么第一个“&++
在我的学习过程中,我遇到了前后迭代器,我想知道是否有办法让它们就地创建容器元素。从文档来看,容器似乎需要实现 push_back 函数才能与 back_iterator 一起使用。但是有没有一种方法可
我有两个关于 Java 中运算符优先级的类似问题。 第一个: int X = 10; System.out.println(X++ * ++X * X++); //it prints 1440 根据
请放轻松,不要对我开枪,因为我还是新手。 当我运行这段代码时,我完全糊涂了,终生无法弄清楚为什么: int y = 9; cout << "++y = " << ++y << "\n--y = " <
两种表达方式有区别吗: (*x)++ 和 ++(*x) 我可以看到这两个语句都替换了 *x 中 (*x+1) 的内容。但是它们之间有什么区别吗? 最佳答案 (*x)++ 计算为*x的值;作为副作用,*
我有一个如下所示的数据集: Date CONSUMER DISCR CONSUMER STAPLES ENERGY FINANCIALS HEALTH CARE
我希望检查名称字段中输入的前两个字符是否为字母 - 除此之外没有什么区别(空格、'、- 等都是公平的游戏)。这是我到目前为止所拥有的,但它不起作用。想法?谢谢! if (document.form01
我制作了一个简单的脚本,为像素和所有附近的像素着色为相同的颜色 Click foto
我需要编写一个循环,以下列格式输出从昨天算起的最近 30 天: 2014-02-02 2014-02-03 2014-02-04 ... 2014-03-04 我想我需要像这样使用循环: for ($
我正在做一些练习,但我对这个感到困惑: public static int f (int x, int y) { int b=y--; while (b>0) { if (x%2!=0
我需要一个 4 个字符的正则表达式。前 3 个字符必须是数字,最后 1 个字符必须是字母或数字。 我形成了这个,但它不起作用 ^([0-9]{3}+(([a-zA-Z]*)|([0-9]*)))?$
我需要编写一个循环,以下列格式输出从昨天算起的最近 30 天: 2014-02-02 2014-02-03 2014-02-04 ... 2014-03-04 我想我需要像这样使用循环: for ($
我有下面的程序,我试图找到前 1000 个素数的总和。在代码中,解决方案1和2有什么区别?为什么我不应该将 count 变量放在 if 条件之外?如果我把变量放在 if 之外,我显然没有得到我需要的答
这个问题在这里已经有了答案: Replace First N Occurrences in the String (7 个答案) 关闭 4 年前。 我有一个如下的字符串 const str = '_
我正在尝试测量以纳秒为单位的平均访问延迟,但在第一次迭代后我收到“段错误(核心转储)”。我错过了什么吗?我是否滥用了指针。这是导致错误的函数: #include #include #include
我有一个 SQL 问题 (MySQL)。我如何从下表创建一个新表(表名称:“well_master_prod_inj”)。 我需要按井名和日期聚合数据。我希望每个井名只有一行数据以及显示以下数据的列:
我是一名优秀的程序员,十分优秀!