算法提高 8-1因式分解（蓝桥杯java）

题目

设计算法，用户输入合数，程序输出若个素数的乘积。例如，输入6，输出23。输入20，输出22*5。

理解

首先得求出素数，求出不大于n的素数，装入数组中，然后在用递归解决。

代码

package mani;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class 因式分解 {
public static void main(String[] args) {
	Scanner scanner=new Scanner(System.in);
	int n=scanner.nextInt();
//	System.out.println(suzu.toString());
	dgjs(n);
	
}
//因为求素数非常占运行时间，所以直接先求出来
static int jj[]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,
		83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,
		167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,
		257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,
		353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443
		,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,
		563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,
		653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,
		761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,
		877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,
		991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,
		1069,1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,1163,
		1171,1181,1187,1193,1201,1213,1217,1223};

//递归
private static void dgjs(int n) {
	// TODO Auto-generated method stub
	for (int i = 0; i <jj.length; i++) {//循环数组
		if (n%jj[i]==0) {
			if (n/jj[i]==1) {//判断是否是最后一个
				System.out.print(jj[i]);
				return;
			}
			System.out.print(jj[i]+"*");
			dgjs(n/jj[i]);
			break;
		}
	}
}
}```