java easy solution
java, simple triangle property\n# Code\n\nclass Solution {\n    public int largestPerimeter(int[] nums) {\n        Arrays.sort(nums);\n        for(int i=nums.le
java, simple triangle property\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-1]+nums[i-2]>nums[i]){\n                return nums[i-1]+nums[i-2]+nums[i];\n            }\n        }\n        return 0;\n    }\n}\n```
['Sorting', 'Java']