Easy Solution || Beats 99.66%
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int largestPerimeter(int[] nums) {\n        Arrays.sort(nums);\n        for(int i = nums.length-1;i>=2;i--){\n            if(nums[i] < nums[i-1]+nums[i-2]){\n                return (nums[i]+nums[i-1]+nums[i-2]);\n            }\n        }\n        return 0;\n    }\n}\n```
['Java']