Simple Java Solution
```\nclass Solution {\n    public int largestPerimeter(int[] nums) {\n        Arrays.sort(nums);\n        \n        for(int i = nums.length - 3; i >= 0; i--) {\
```\nclass Solution {\n    public int largestPerimeter(int[] nums) {\n        Arrays.sort(nums);\n        \n        for(int i = nums.length - 3; i >= 0; i--) {\n            if(nums[i] + nums[i + 1] > nums[i + 2])\n                return nums[i] + nums[i + 1] + nums[i + 2];\n        }\n        return 0;\n    }\n}
['Java']