如何在Java中从一组数字中找到完美平方？

import java.util.ArrayList;
import java.util.Arrays;

public class PerfectSquareFinder {
    public static int[] findPerfectSquares(int[] nums) {
        ArrayList<Integer> squares = new ArrayList<>();

        for (int num : nums) {
            double squareRoot = Math.sqrt(num);
            int roundedSquareRoot = (int) Math.round(squareRoot);
            if (roundedSquareRoot * roundedSquareRoot == num) {
                squares.add(num);
            }
        }

        int[] result = new int[squares.size()];
        for (int i = 0; i < squares.size(); i++) {
            result[i] = squares.get(i);
        }

        return result;
    }

    public static void main(String[] args) {
        int[] nums = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
        int[] perfectSquares = findPerfectSquares(nums);
        System.out.println("Perfect squares: " + Arrays.toString(perfectSquares));
    }
}