Skip to content

Козельских_ДЗ первой недели #37

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 3 commits into
base: dev
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 7 additions & 1 deletion topic-1/task-1/index.js
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,13 @@
* @returns
*/

function isTriangle(a, b, c) {
isTriangle(7, 2, 2)
function isTriangle(a, b, c) {
if (a + b > c && a + c > b && b + c > a) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

3 целочисленных значения
добавить валидацию входных аргументов

return true;
} else {
return false;
}
}

module.exports.isTriangle = isTriangle;
22 changes: 20 additions & 2 deletions topic-1/task-2/index.js
Original file line number Diff line number Diff line change
Expand Up @@ -11,7 +11,25 @@
* @param {*} array массив
* @returns удвоенный массив
*/
function calculateDoubleArray(array) {

let array = [1, 2, 3, 4, 5, 0, 0, 0, 0, 0]

calculateDoubleArray(array)

function calculateDoubleArray(array) {
for (let i = 0; i < array.length; i++) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

добавить проверку входного массива на корректность

if (array[i] === 0) {
array.splice(i, 1)
i--
} else {
array.splice(i, 0, array[i])
i++
}
}
return array

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

calculateDoubleArray([1, 2, 3, 4, 5]) - вернёт тот же результат что и [1, 2, 3, 4, 5, 0, 0, 0, 0, 0].
Добавить логику проверки для свободных ячеек.

}

module.exports.calculateDoubleArray = calculateDoubleArray;

module.exports.calculateDoubleArray = calculateDoubleArray;


13 changes: 13 additions & 0 deletions topic-1/task-3/index.js
Original file line number Diff line number Diff line change
Expand Up @@ -10,6 +10,19 @@
*/

function factorial(n) {
if (n > 0) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

нет проверки, что входной аргумент число, и что оно целое

let temp = 1
for (let i = n; i > 0; i--) {
temp = temp * i
}
return temp
}
if (n == 0) {
return 1
} else {
throw new Error("Число меньше 0")
}
}


module.exports.factorial = factorial;
13 changes: 12 additions & 1 deletion topic-1/task-4/index.js
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,18 @@
* @param {string[]} nameArray - массив имён.
* @return {number} Количество уникальных имён
* */

function countUniqueName(nameArray) {

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

image
добавить проверку входных данных

var lowerArray = [];
for (i = 0; i < nameArray.length; i++) {
let name = nameArray[i].toString().toLowerCase()
lowerArray.push(name)
}

const unique = new Set(lowerArray);

return unique.size
}

module.exports.countUniqueName = countUniqueName;
module.exports.countUniqueName = countUniqueName;
27 changes: 26 additions & 1 deletion topic-1/task-5/index.js
Original file line number Diff line number Diff line change
Expand Up @@ -4,7 +4,32 @@
* Предусмотреть крайние случаи, для входных данных и при необходимости
* выкидывать исключение.
* */
function kaprekarConstant(number){

function kaprekarConstant(number) {
let countDigits = number.toString().length;

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

kaprekarConstant(2223) - зависает. Добавить обработку входных данных

//Шаг первый: проверка на коиличество цифр. Должно быть 4.
if (countDigits === 4) {
var digitToArray = number.toString().split("");
var arrayToCompareDigit = new Set(digitToArray)
//Шаг второй: проверка на коиличество повторений цифр. Должна хотя бы одна не повториться.
if (arrayToCompareDigit.size > 1) {
var result = number
//Проверяем, выполнено ли условие
while (result != 6174) {
result = result.toString().split("");
//Шаг третий: создания чисел из исходного с отсортированными цифрами от большего к меньшему и от меньшего к большему
let numberFromBigToSmall = result.sort((a, b) => b - a).join('');
let numberFromSmallToBIG = result.sort((a, b) => a - b).join('');
//Шаг четвертый: вычетаем из большего меньшее
var result = numberFromBigToSmall - numberFromSmallToBIG
}
return result
} else {
throw new Error('Число не должно состоять из одинаковых цифр.')
}
} else {
throw new Error('Число не из 4-х цифр.')

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

image
думаю можно уточнить условие проверки)

https://www.dcode.fr/kaprekar-algorithm - я тестил тут

}
}

module.exports.kaprekarConstant = kaprekarConstant;