【算法】程序猿不写代码是不对的40

来源：互联网发布：div into python 编辑：程序博客网时间：2024/05/18 00:17

package com.kingdz.algorithm.time201704;/** * 某一种网上的非递归汉诺塔解法，解题思路暂时我不清楚 *  * @author kingdz *  */public class Algo10 {public static void main(String[] args) {int[] level_position = new int[100];int n = 3;int sample_nub = 0;int total_sample = 1;for (int i = 1; i < n; i++) {total_sample *= 2;}for (int i = 0; i <= n; i++) {level_position[i] = 0;}int i = n;level_position[i]++;output(i, level_position[n], n);sample_nub++;while (sample_nub < total_sample) {while (level_position[i] == 2 * level_position[i - 1]) {i--;}level_position[i - 1]++;output(i - 1, level_position[i - 1], n);i = n;level_position[i]++;output(i, level_position[n], n);sample_nub++;}output(1, 1, 1);}private static void output(int present_level, int position, int n) {int val = (position - 1) % 3;if (present_level % 2 == 1) {val = val + 3;}switch (val) {case 0:System.out.println(n - present_level + 1 + "\tfrom A to B");break;case 1:System.out.println(n - present_level + 1 + "\tfrom B to C");break;case 2:System.out.println(n - present_level + 1 + "\tfrom C to A");break;case 3:System.out.println(n - present_level + 1 + "\tfrom A to C");break;case 4:System.out.println(n - present_level + 1 + "\tfrom C to B");break;case 5:System.out.println(n - present_level + 1 + "\tfrom B to A");break;}}}

0 0