Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class Solution {
- public int LargestPerimeter(int[] A) {
- Array.Sort(A);
- for(int i = A.Length-1; i >= 2; i--){
- if(A[i-1] + A[i-2] > A[i])
- return A[i] + A[i-1] + A[i-2];
- }
- return 0;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement