1018. Largest Perimeter Triangle
My accepted C++ solution to LeetCode problem 1018, Largest Perimeter Triangle, running in 2ms.
- Difficulty: Easy
- C++
- Runtime 2ms
- Memory 25.7MB
- Updated
Read the problem on LeetCode View on GitHub
The problem statement is LeetCode’s and stays on their site. What follows is my accepted solution.
C++
Accepted on LeetCode — runtime 2ms, memory 25.7MB, accepted 2025-12-27.
class Solution {
public:
int largestPerimeter(vector<int>& nums) {
sort(nums.begin(), nums.end(), greater<int>());
for (int i = 0; i < nums.size() - 2; i++) {
if (nums[i] < nums[i+1] + nums[i+2]) {
return nums[i] + nums[i+1] + nums[i+2];
}
}
return 0;
}
};