DE
Это неправильное решение
/**
* @param {number[]} nums
* @return {number}
*/
var largestPerimeter = function(nums) {
function checkTriangle (sides) {
return sides[0] < sides[1] + sides[2] &&
sides[1] < sides[0] + sides[2] &&
sides[2] < sides[1] + sides[0];
}
function combine(items, numSubItems) {
var result = [];
var indexes = new Array(numSubItems);
for (var i = 0 ; i < numSubItems; i++) {
indexes[i] = i;
}
while (indexes[0] < (items.length - numSubItems + 1)) {
var v = [];
for (var i = 0 ; i < numSubItems; i++) {
v.push(items[indexes[i]]);
}
result.push(v);
indexes[numSubItems - 1]++;
var l = numSubItems - 1; // reference always is the last position at beginning
while ( (indexes[numSubItems - 1] >= items.length) && (indexes[0] < items.length - numSubItems + 1)) {
l--; // the last position is reached
indexes[l]++;
for (var i = l +1 ; i < numSubItems; i++) {
indexes[i] = indexes[l] + (i - l);
}
}
}
return result;
}
const triplets = combine(nums, 3).map((p)=>[...p, p.reduce((a,b)=>a+b)]).sort((a, b) => a[3] !== b[3]
? (a[3] < b[3] ? 1 : -1)
: 0);
for (let i = 0; i < triplets.length; i += 1) {
if (checkTriangle(triplets[i])) {
return triplets[i][3];
}
}
return 0;
};
Вот работает но памяти не хватает
