You are viewing a single comment's thread. Return to all comments →
Java Solution:
import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { public static void main(String[] args) { Scanner in = new Scanner(System.in); int N = in.nextInt(); Integer[] lengths = new Integer[N]; for(int i = 0; i < N; i++) lengths[i] = in.nextInt(); Arrays.sort(lengths, Collections.reverseOrder()); int i; for(i = 0; i <= N-3; i++) { int length1 = lengths[i]; int length2 = lengths[i+1]; int length3 = lengths[i+2]; if(triangleMeetsCriteria(length1,length2,length3)) { printTriangle(length3,length2,length1); break; } } if(i == N-2) printNoTriangle(-1); } public static void printTriangle(int side1, int side2, int side3) { System.out.println(side1 + " " + side2 + " " + side3); } public static void printNoTriangle(int result) { System.out.println(result); } public static boolean triangleMeetsCriteria(int length1, int length2, int length3) { if( ((length1 + length2) > length3) && ((length1 + length3) > length2) && ((length2 + length3) > length1) ) return true; return false; } }
Seems like cookies are disabled on this browser, please enable them to open this website
Maximum Perimeter Triangle
You are viewing a single comment's thread. Return to all comments →
Java Solution: