用最短路径解决问题的一个实例

package c2021;

public class zuiduanlujing {

	 int n = 2021;
	 int cha = 21;
	 int templist[] = new int[n + 1];
	 int list[][] = new int[n + 1][n + 1];
	 boolean flag[] = new boolean[n + 1];
	 public static void main(String[] args) {
		zuiduanlujing z = new zuiduanlujing();
		z.start();
	}
	public void start() {
		for (int i = 1; i <= n; i++) {
			templist[i] = -1;
		}
		templist[1] = 0;
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j < i; j++) {
				if (i - j <= cha) {
					int zuixiaogongbeishu;
					for (int k = i; ; k++) {
						if (k % i == 0 && k % j == 0) {
							zuixiaogongbeishu = k;
							break;
						}
					}
					list[i][j] = zuixiaogongbeishu;
					list[j][i] = zuixiaogongbeishu;
				}else {
					list[i][j] = -1;
					list[j][i] = -1;
				}
			}
			System.out.println(i);
		}
		templist[1] = 0;
		flag[1] = true;
		jisuan(1);
		System.out.println(templist[n]);
	}
	 
	 
	public  void jisuan(int i) {
		if (i == n) {
			return;
		}
		for (int j = 1; j <= n; j++) {
			if (list[i][j] != -1) {
				if (templist[j] != -1) {
					templist[j] = Math.min(templist[j],templist[i] + list[i][j]);
				}else {
					templist[j] = templist[i] + list[i][j];
				}
			}
		}
		int minindex = 0;
		for (int j = 1; j <= n; j++) {
			if (!flag[j] && templist[j] != -1) {
				minindex = j;
				break;
			}
		}
		for (int j = 1; j <= n; j++) {
			if (flag[j]) {
				continue;
			}else {
				if (templist[j] != -1 && templist[j] < templist[minindex]) {
					minindex = j;
				}
			}
		}
		flag[minindex] = true;
		jisuan(minindex);
	}
}