chore(i8n,learn): processed translations

This commit is contained in:
Crowdin Bot
2021-02-06 04:42:36 +00:00
committed by Mrugesh Mohapatra
parent 15047f2d90
commit e5c44a3ae5
3274 changed files with 172122 additions and 14164 deletions

View File

@ -1,85 +1,94 @@
---
id: 595011cba5a81735713873bd
title: 每组排名最高
title: Top rank per group
challengeType: 5
videoUrl: ''
forumTopicId: 302339
dashedName: top-rank-per-group
---
# --description--
任务:
Find the top `n` ranked data in each group, where `n` is provided as a parameter. Name of the rank and the group are also provided as parameter.
在每个组中查找排名前N位的数据其中N作为参数提供。等级和组的名称也作为参数提供。
Given the following data:
鉴于以下数据:
<pre>[
{ name: 'Tyler Bennett', id: 'E10297', salary: 32000, dept: 'D101' },
{ name: 'John Rappl', id: 'E21437', salary: 47000, dept: 'D050' },
{ name: 'George Woltman', id: 'E00127', salary: 53500, dept: 'D101' },
{ name: 'Adam Smith', id: 'E63535', salary: 18000, dept: 'D202' },
{ name: 'Claire Buckman', id: 'E39876', salary: 27800, dept: 'D202' },
{ name: 'David McClellan', id: 'E04242', salary: 41500, dept: 'D101' },
{ name: 'Rich Holcomb', id: 'E01234', salary: 49500, dept: 'D202' },
{ name: 'Nathan Adams', id: 'E41298', salary: 21900, dept: 'D050' },
{ name: 'Richard Potter', id: 'E43128', salary: 15900, dept: 'D101' },
{ name: 'David Motsinger', id: 'E27002', salary: 19250, dept: 'D202' },
{ name: 'Tim Sampair', id: 'E03033', salary: 27000, dept: 'D101' },
{ name: 'Kim Arlich', id: 'E10001', salary: 57000, dept: 'D190' },
{ name: 'Timothy Grove', id: 'E16398', salary: 29900, dept: 'D190' }
];
</pre>
```
[
{姓名:'Tyler Bennett'id'E10297'薪水32000部门'D101'}
{姓名:'John Rappl'id'E21437'薪水47000部门'D050'}
{姓名:'George Woltman'id'E00127'薪水53500部门'D101'}
{name'Adam Smith'id'E63535'薪水18000部门'D202'}
{姓名:'Claire Buckman'id'E39876'薪水27800部门'D202'}
{姓名:'David McClellan'id'E04242'薪水41500部门'D101'}
{name'Rich Holcomb'id'E01234'薪水49500dept'D202'}
{姓名:'Nathan Adams'id'E41298'薪水21900部门'D050'}
{姓名:'Richard Potter'id'E43128'薪水15900部门'D101'}
{姓名:'David Motsinger'id'E27002'薪水19250dept'D202'}
{姓名:'Tim Sampair'id'E03033'薪水27000部门'D101'}
{姓名:'Kim Arlich'id'E10001'薪水57000部门'D190'}
{name'Timothy Grove'id'E16398'薪水29900部门'D190'}
]。
```
one could rank top 10 employees in each department by calling
</pre>通过调用<code>topRankPerGroup(10, data, 'dept', 'salary')</code>可以对每个部门的前10名员工进行排名。给出以下数据 <pre> [
{name'Friday 13th',类型:'恐怖'评分9.9}
{姓名:“榆树街上的梦魇”,类型:'恐怖'等级5.7}
{name'Titanic',类型:'drama'评分7.3}
{name'Maze Runner',类型:'scifi'评级7.1}
{name'Blade runner',类型:'scifi'评分8.9}
]。
</pre>通过调用<code>topRankPerGroup(1, data, 'genre', 'rating')</code>可以在每个类型中对排名最高的电影进行排名
`topRankPerGroup(10, data, 'dept', 'salary')`
Given the following data:
<pre>[
{ name: 'Friday 13th', genre: 'horror', rating: 9.9 },
{ name: "Nightmare on Elm's Street", genre: 'horror', rating: 5.7 },
{ name: 'Titanic', genre: 'drama', rating: 7.3 },
{ name: 'Maze Runner', genre: 'scifi', rating: 7.1 },
{ name: 'Blade runner', genre: 'scifi', rating: 8.9 }
];
</pre>
one could rank the top-rated movie in each genre by calling
`topRankPerGroup(1, data, 'genre', 'rating')`
The function should return an array with an array for each group containing the top `n` objects.
# --hints--
`topRankPerGroup`是一个函数。
`topRankPerGroup` should be a function.
```js
assert(typeof topRankPerGroup === 'function');
```
`topRankPerGroup`在负n值上返回undefined。
`topRankPerGroup` should return undefined on negative n values.
```js
assert(typeof topRankPerGroup(-1, []) === 'undefined');
```
第一部门必须​​是D050
First department should be D050
```js
assert.equal(res1[0][0].dept, 'D050');
```
第一部门必须​​是D050
First department should be D050
```js
assert.equal(res1[0][1].salary, 21900);
```
最后一个部门必须是D202
The last department should be D202
```js
assert.equal(res1[3][3].dept, 'D202');
```
`topRankPerGroup(1, ...)`必须仅返回每组的排名最高的结果。
`topRankPerGroup(1, ...)` should return only top ranking result per group.
```js
assert.equal(res2[2].length, 1);
```
`topRankPerGroup(1, ...)`必须仅返回每组的排名最高的结果。
`topRankPerGroup(1, ...)` should return only top ranking result per group.
```js
assert.equal(res3[2][1].name, 'Maze Runner');