Advertisement
Guest User

Untitled

a guest
Apr 24th, 2019
88
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.28 KB | None | 0 0
  1. public class Solution {
  2. public int LargestPerimeter(int[] A) {
  3.  
  4. Array.Sort(A);
  5.  
  6. for(int i = A.Length-1; i >= 2; i--){
  7. if(A[i-1] + A[i-2] > A[i])
  8. return A[i] + A[i-1] + A[i-2];
  9. }
  10.  
  11. return 0;
  12. }
  13. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement