Count Square Sum Triples LeetCode solution in Python

1
class Solution:
2
def countTriples(self, n: int) -> int:
3
c = 0
4
for i in range(1, n + 1):
5
for j in range(i + 1, n + 1):
6
sq = i * i + j * j
7
r = int(sq**0.5)
8
if r * r == sq and r <= n:
9
c += 2
10
return c

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0