Java统计整数各质因数出现次数并输出最高次数对应质因数
Java质因数最高出现次数统计代码修改方案
你现有的代码已经完成了质因数分解,并将<质因数, 出现次数>的映射关系存储在了TreeMap中,只需要新增遍历Map统计最大值的逻辑即可实现需求。
修改后的完整代码如下:
import java.util.Scanner; import java.util.TreeMap; import java.util.Map; public class Main { public static void main(String[] args) { int num; Scanner in = new Scanner(System.in); System.out.print("Enter a number: "); num = in.nextInt(); TreeMap<Integer, Integer> factors = new TreeMap<>(); for (int i =2; i < num; i++){ int count = 0; while (num%i == 0){ System.out.println(i + " "); num = num/i; count ++; } if (count > 0){ factors.put(i, count); } } if (num > 2){ System.out.println(num + " "); factors.put(num, 1); } System.out.println( "-------------" ); for( Integer factor : factors.keySet() ){ System.out.println( factor + "^" + factors.get( factor ) ); } // 新增统计最高出现次数逻辑 int maxCount = 0; int targetFactor = 0; for (Map.Entry<Integer, Integer> entry : factors.entrySet()) { if (entry.getValue() > maxCount) { maxCount = entry.getValue(); targetFactor = entry.getKey(); } } System.out.println("Maximum Number of Time occurrence = " + maxCount + " and the number is " + targetFactor); } }
效果验证
输入720时,输出结果和预期完全一致:
2^4 3^2 5^1 Maximum Number of Time occurrence = 4 and the number is 2
如果存在多个质因数出现次数同为最大值,因为TreeMap默认按升序排列,会优先返回数值更小的质因数。
内容的提问来源于stack exchange,提问作者NARAYAN
相关产品推荐
相关产品推荐

