#include "leetcode.h" class Solution { public: int largestPerimeter(vector &nums) { sort(nums.begin(), nums.end()); for (int i = nums.size() - 1; i > 1; --i) if (nums[i] < nums[i - 1] + nums[i - 2]) return nums[i] + nums[i - 1] + nums[i - 2]; return 0; } }; int main() { Solution obj; vector nums = {2, 1, 2}; cout << obj.largestPerimeter(nums); }