Java、完全平方

 编写一个程序，提示用户输入一个整数m，然后找到最小的整数n，使得m * n 是一个完全平方；

---

package pack1;

import java.util.*;

public class SquareNumbers {
    public static void main(String[] args) {
        try(Scanner input = new Scanner(System.in);) {
            System.out.print("Enter an integer m: ");
            int m = input.nextInt();

            int n = getN(getNumbers(m));
            System.out.println("The smallest number n for m * n to be a " + 
                    " perfect square is " + n);
            System.out.println("m * n is " + (m * n));
        }
    }

    /**返回最小因子的数组列表*/
    public static ArrayList<Integer> getNumbers(int integer) {
        ArrayList<Integer> list = new ArrayList<>();
        int i = 2;

        while (true) {
            if(integer % i == 0) {
                list.add(i);
                integer /= i;
            }else i++;
            if(integer == 1) break;
        }
        return list;
    }

    /**返回N*/
    public static int getN(ArrayList<Integer> list) {
        Map<Integer, Integer> map = new HashMap<>();    //散列表对象
        int n = 1;

        for (Integer i : list)
            if(!map.containsKey(i)) //如果散列表不包含值i，添加值
                map.put(i, 1);
            else {  //包含值时，次数加1
                int value = map.get(i);
                map.put(i, ++value);
            }

        for (Map.Entry<Integer, Integer> i : map.entrySet())
            if(i.getValue() % 2 != 0) n *= i.getKey();  //如果次数为奇数，n *= 值
        return n;
    }
}

---