相关题目:
![](https://img-blog.csdnimg.cn/5eaf51b0c1e64bfcb8c7520e1438f63b.png?x-oss-process=image/watermark,type_d3F5LXplbmhlaQ,shadow_50,text_Q1NETiBA6L-c5LiN5Y-K5L2g55qE5b6u56yR,size_20,color_FFFFFF,t_70,g_se,x_16)
解题思路:
相关代码:
class Solution {
public:
int largestPerimeter(vector<int>& nums) {
int res=0;
sort(nums.begin(),nums.end());
for(int i=2;i<nums.size();i++){
if(nums[i-1]+nums[i-2]>nums[i])
res=max(res,nums[i-1]+nums[i-2]+nums[i]);
}
return res;
}
};