public java.lang.String solve()It solves the problem by testing every combination of integer sides to be a
Pythagorean Triplet. If a triplet is found the number of hits is incremented for the sum of the three sides. Finally, the perimeter with the most hits is returned.
- the perimeter that has the maximum combination of sides
- See Also:
Mathe.isPythagoreanTriplet(int, int, int)