Added _976.java (#33)

Added _976.java

Added _976.java

Author: varunu28

Leetcode.iml

@@ -29,6 +29,7 @@ Your ideas/fixes/algorithms are more than welcome!
 
 |  #  |      Title     |   Solutions   | Time          | Space         | Video  | Difficulty  | Tag                   
 |-----|----------------|---------------|---------------|---------------|--------|-------------|-------------
+|976|[Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_976.java) | O(nlogn) | O(1) | |Easy| Math Array
 |973|[K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_973.java) | O(nlogn) | O(K) | |Easy| Math Sort
 |970|[Powerful Integers](https://leetcode.com/problems/powerful-integers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_970.java) | O(?) | O(1) | |Easy| Math
 |966|[Vowel Spellchecker](https://leetcode.com/problems/vowel-spellchecker/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_966.java) | O(hlogn) | O(n) | |Medium| Hash Table, String

README.md

@@ -0,0 +1,30 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+/**
+ * 976. Largest Perimeter Triangle
+ *
+ * Given an array A of positive lengths, return the largest perimeter of a triangle with non-zero area, formed from 3
+ * of these lengths.
+ *
+ * If it is impossible to form any triangle of non-zero area, return 0.
+ * */
+
+public class _976 {
+
+    public static class Solution1 {
+        public int largestPerimeter(int[] A) {
+            Arrays.sort(A);
+            int n = A.length;
+
+            for (int i = n - 1; i > 1; i--) {
+                if (A[i] < A[i - 1] + A[i - 2]) {
+                    return A[i] + A[i - 1] + A[i - 2];
+                }
+            }
+
+            return 0;
+        }
+    }
+}

src/main/java/com/fishercoder/solutions/_976.java

@@ -0,0 +1,37 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._976;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _976Test {
+
+    private static _976.Solution1 test;
+
+    @BeforeClass
+    public static void setUp() {
+        test = new _976.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(5, test.largestPerimeter(new int[]{2, 1, 2}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(0, test.largestPerimeter(new int[]{1, 2, 1}));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(10, test.largestPerimeter(new int[]{3, 2, 3, 4}));
+    }
+
+    @Test
+    public void test4() {
+        assertEquals(8, test.largestPerimeter(new int[]{3, 6, 2, 3}));
+    }
+}