Largest Perimeter Triangle LeetCode solution in JavaScript

1
/**
2
* @param {number[]} nums
3
* @return {number}
4
*/
5
var largestPerimeter = function (nums) {
6
const sorted = nums.sort((a, b) => a - b);
7
const result = [];
8

9
for (let i = 0; i < sorted.length; i++) {
10
if (
11
sorted[i] + sorted[i + 1] > sorted[i + 2] &&
12
sorted[i + 2] + sorted[i + 1] > sorted[i] &&
13
sorted[i] + sorted[i + 2] > sorted[i + 1]
14
) {
15
result.push(sorted[i] + sorted[i + 1] + sorted[i + 2]);
16
}
17
}
18
if (result.length !== 0) {
19
return Math.max(...result);
20
} else {
21
return 0;
22
}
23
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0