Q976 added.

Author: isinsuarici

E_976_LargestPerimeterTriangle.java

@@ -0,0 +1,11 @@
+class Solution {
+    public int largestPerimeter(int[] nums) {
+        Arrays.sort(nums);
+        for(int i=nums.length-1; i>=2; i--){
+            if(nums[i]<nums[i-1]+nums[i-2]){
+                return nums[i]+nums[i-1]+nums[i-2];
+            }
+        }
+        return 0;
+    }
+}