@@ -0,0 +1,606 @@
+package leetcode;%0A%0A/**%0A * https://leetcode.com/problems/largest-perimeter-triangle/%0A */%0Apublic class Problem976 %7B%0A    public int largestPerimeter(int%5B%5D A) %7B%0A        // TODO%0A        return 0;%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        Problem976 prob = new Problem976();%0A        System.out.println(prob.largestPerimeter(new int%5B%5D%7B2, 1, 2%7D)); // 5%0A        System.out.println(prob.largestPerimeter(new int%5B%5D%7B1, 2, 1%7D)); // 0%0A        System.out.println(prob.largestPerimeter(new int%5B%5D%7B3, 2, 3, 4%7D)); // 10%0A        System.out.println(prob.largestPerimeter(new int%5B%5D%7B3, 6, 2, 3%7D)); // 8%0A    %7D%0A%7D%0A

Update problem 976