[JAVA] easy solution , faster than 99.57%
\nclass Solution {\n    public int largestPerimeter(int[] nums) {\n     Arrays.sort(nums);\n      for(int i = nums.length - 1; i > 1; i --) \n        if(nums[i]
```\nclass Solution {\n    public int largestPerimeter(int[] nums) {\n     Arrays.sort(nums);\n      for(int i = nums.length - 1; i > 1; 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}\n```\n# PLEASE UPVOTE IF IT WAS HELPFULL
['Sorting', 'Java']