大家帮帮忙！

Question

假定汉诺塔问题中的三根柱子的编号是A、B、C,要求输出n个金片从A柱子移动到C柱子的移动过程。每次只能移动一片金片,并且小金片永远在大金片的上面。 以下代码是用分治算法实现的,空白处的代码应该填什么? public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc = new Scanner(System.in); int r = sc.nextInt(); f("A", "C", "B", r); } public static void f(String s, String d, String k, int n){ if(n == 1){ System.out.println(s + "->" + d); return; } f(s,k,d,n-1); f(s,d,k,1); ; }

• A、f(s,d,k,n-1)

• B、f(k,d,s,n-1)

• C、f(s,d,k,n-1)

• D、f(d,k,s,n-1)

Answer 1

MPYEYYEATAQMCBRRHZSYIOVENJZBLAORGNKZPZVYBDAWQGAJMPETQTWPYBXMJLUBLHUWMORUXFIFUIYFIQNQSVLGYNJGVSIENXEPLUWZUDMILVACYOEAJXADFMCEBETWSGWMZIWFBXHDFPYMIRSOXTWLJFLNQTWYUDGWMJLHRMCYUDHDVQGPFUIYHQZVXNOENPFHUDPEAJLOLADGHPSHEZWFHKNJVYTOEAQTVFBBRGWRURNQMCOXSVKNKSCLMSADZOJLVDGDCEHDFVYUEZPDZCYNXFVXURYAJFBEGDZPEGJEHJTTWFVXGPKNKMPXGCLVEFHXZJFUXNORTDGPSOKNQKHPZVXUXMNKLACYOKZCLBXDFBYUQGWZNJCYHQFIFOKTWYUJTIEUQGIRUJMVEUXSISTMBLAIRBXGJTPROQZWSBENCETCFOJLBXTCAKZIFODAPYIEOQMIDTBKTWEHPFAPZBXAPHWFBQTVRBQGFHCFUDMPSUDLLBEGWNDSBEYUQMPSHKMPFFVXHDMPEGCSUCYOWZHKNDGEAWZADAQSILWMBKAJZODZWBLNNQAUQGDZEFBRMWZCEOKSBEAQADMVEAORTJMVLADTPHWFIDTBKGXGZVEZBRZJLAQLUJGPEODGJFXZIFZPFOKGWDZVLAIEOKMCYHPSNDMPYIQCLOEGPYHRGUYNPRAJZVRNKGVYBWGTWTIYRHCZBXNPFNWDYIYNDLIEHQENCMIXNWSILQSISSVLAXGJIDZWFBETWFOOREUGDNJGGFYHWZVYOXZJSNWRUKZWXZJSBXZPLOXGJSIHWZNWMHEUJMVLTJTVKSORIOEUKXUDMPYOHENWSPRAWZOLUQRNDTCYCYEFBEGWFPKNKWETWYVETJGD