В
const largestPerimeter = (arr = []) => {
arr.sort((a, b) => a - b);
let max = 0;
for (let i = arr.length - 1; i >= 2; i--) {
let start = i - 2;
let end = i - 1;
while (start < end) {
if (arr[end] + arr[start] > arr[i]) {
return arr[end] + arr[start] + arr[i];
}
else {
start++;
};
};
};
return 0;
};
arr.sort((a, b) => a - b);
let max = 0;
for (let i = arr.length - 1; i >= 2; i--) {
let start = i - 2;
let end = i - 1;
while (start < end) {
if (arr[end] + arr[start] > arr[i]) {
return arr[end] + arr[start] + arr[i];
}
else {
start++;
};
};
};
return 0;
};
