mirror of
https://github.com/freeCodeCamp/freeCodeCamp.git
synced 2026-05-09 21:01:20 -04:00
121 lines
3.0 KiB
Markdown
121 lines
3.0 KiB
Markdown
---
|
||
id: 5e6dd139859c290b6ab80292
|
||
title: Задача про найдовшу зростаючу підпослідовність
|
||
challengeType: 1
|
||
forumTopicId: 385272
|
||
dashedName: longest-increasing-subsequence
|
||
---
|
||
|
||
# --description--
|
||
|
||
The longest increasing subsequence problem is to find a subsequence of a given sequence in which the subsequence's elements are in sorted order, lowest to highest, and in which the subsequence is as long as possible. An example:
|
||
|
||
Для наступного масиву:
|
||
|
||
```js
|
||
const array = [3, 10, 2, 1, 20];
|
||
```
|
||
|
||
Найдовша зростаюча підпослідовність:
|
||
|
||
$\\{3, 10, 20\\}$
|
||
|
||
# --instructions--
|
||
|
||
Напишіть функцію, яка приймає масив чисел як параметр і виводить найдовшу зростальну послідовність.
|
||
|
||
Гарантовано, що кожен масив матиме найдовшу зростаючу послідовність.
|
||
|
||
# --hints--
|
||
|
||
`findSequence` має бути функцією.
|
||
|
||
```js
|
||
assert(typeof findSequence == 'function');
|
||
```
|
||
|
||
`findSequence([3, 10, 2, 1, 20])` повинен повертати масив.
|
||
|
||
```js
|
||
assert(Array.isArray(findSequence([3, 10, 2, 1, 20])));
|
||
```
|
||
|
||
`findSequence([3, 10, 2, 1, 20])` повинен повертати `[3, 10, 20]`.
|
||
|
||
```js
|
||
assert.deepEqual(findSequence([3, 10, 2, 1, 20]), [3, 10, 20]);
|
||
```
|
||
|
||
`findSequence([2, 7, 3, 5, 8])` повинен повертати `[2, 3, 5, 8]`.
|
||
|
||
```js
|
||
assert.deepEqual(findSequence([2, 7, 3, 5, 8]), [2, 3, 5, 8]);
|
||
```
|
||
|
||
`findSequence([2, 6, 4, 5, 1])` повинен повертати `[2, 4, 5]`.
|
||
|
||
```js
|
||
assert.deepEqual(findSequence([2, 6, 4, 5, 1]), [2, 4, 5]);
|
||
```
|
||
|
||
`findSequence([10, 22, 9, 33, 21, 50, 60, 80])` повинен повертати `[10, 22, 33, 50, 60, 80]`.
|
||
|
||
```js
|
||
assert.deepEqual(findSequence([10, 22, 9, 33, 21, 50, 60, 80]), [
|
||
10,
|
||
22,
|
||
33,
|
||
50,
|
||
60,
|
||
80
|
||
]);
|
||
```
|
||
|
||
`findSequence([0, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15])` повинен повертати `[0, 2, 6, 9, 11, 15`.
|
||
|
||
```js
|
||
assert.deepEqual(
|
||
findSequence([0, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15]),
|
||
[0, 2, 6, 9, 11, 15]
|
||
);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function findSequence(input) {
|
||
|
||
}
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
function findSequence(input) {
|
||
var len = input.length;
|
||
var result = []
|
||
for (var i = 0; i < len; i++) result.push(1)
|
||
|
||
for (var i = 0; i < len; i++)
|
||
for (var j = i - 1; j >= 0; j--)
|
||
if (input[i] > input[j] && result[j] >= result[i])
|
||
result[i] = result[j] + 1;
|
||
|
||
var maxValue = Math.max.apply(null, result);
|
||
var maxIndex = result.indexOf(Math.max.apply(Math, result));
|
||
var output = [];
|
||
output.push(input[maxIndex]);
|
||
for (var i = maxIndex; i >= 0; i--) {
|
||
if (maxValue == 0) break;
|
||
if (input[maxIndex] > input[i] && result[i] == maxValue - 1) {
|
||
output.push(input[i]);
|
||
maxValue--;
|
||
}
|
||
}
|
||
output.reverse();
|
||
return output;
|
||
}
|
||
```
|