如何找到数组中毕达哥拉斯三胞胎的速度比O(N ^ 2)?

Can someone suggest an algorithm that finds all Pythagorean triplets among numbers in a given array? If it's possible, please, suggest an algorithm faster than O(nCan someone suggest an algorithm that finds all