澶у鐨勬暟鎹粨鏋勫拰綆楁硶鏍規湰灝辨槸娣瘋繃鏉ョ殑錛屾煇澶╁湪鏌愭煇璁哄潧閲屾湁涓叧浜庢暟鎹粨鏋勫拰綆楁硶鍒板簳鍦ㄦ棩甯哥殑緙栫▼鍒板簳鏈夊澶х殑鐢ㄥ銆傚浜庢垜鏉ヨ錛屾垜騫朵笉瑙夊緱鎴戠敤涓婁簡閭ｄ簺璁茬殑鏁版嵁緇撴瀯鍜岀畻娉曘?/SPAN>Java Collection Framework宸茬粡璺熸垜浠仛浜嗚繖浜涖傛垜宸茬粡鑳介潪甯哥啛緇冪殑浣跨敤Collection閲岄潰鐨勭被搴撱備絾鏄垜浠敤鐨勫熀鏈笂閮芥槸閭ｄ簺綰挎ч泦鍚堬紙鍫嗘爤錛岄槦鍒楋紝鍒楄〃錛?/SPAN>Set錛夛紝闈炵嚎鎬ч泦鍚堬紙鏍戯紝鍫嗭紝鏁ｅ垪鍜屽浘錛夋垜鎰熻姣旇緝灝戠敤鍒般傛垜涔熶富瑕佹槸鎯沖闈炵嚎鎬ч泦鍚堝仛涓浜涙瘮杈冦傜嚎鎬ч泦鍚堟瘮杈冪畝鍗曘?/SPAN>
絎竴绔犲埌絎節绔犻兘鏄綰挎ч泦鍚堬紝 涔熸瘮杈冨鏄撶悊瑙ｏ紝 鍦ㄨ繖閲屽氨蹇界暐鎺夈傜鍗佺珷鏄閫掑綊綆楁硶銆傛垜瀵硅繖绔犳瘮杈冩劅鍏磋叮錛岀敤閫掑綊瀹炵幇鏌愪釜綆楁硶鐪熺殑鎰熻闈炲父浼橀泤錛屼唬鐮佺煭鑰屽皯錛岃澶氶潪綰挎ч泦鍚堥兘鏄敤閫掑綊鏉ュ疄鐜扮殑銆備絾涔熸湁浠栫殑緙虹偣錛?/SPAN> 瀵規柟娉曠殑姣忔閫掑綊璋冪敤閮戒細鐢熸垚鏂扮殑灞閮ㄥ彉閲忓拰灞閮ㄥ弬鏁般?/SPAN>鍋囧閫掑綊灞傛澶鐨勮瘽錛屽氨浼氭秷鑰楀お澶氱殑stack銆?/SPAN>
浠諱綍閫掑綊瀹氫箟閮藉繀欏繪湁涓涓潪閫掑綊閮ㄥ垎錛涜繖涓潪閫掑綊閮ㄥ垎鍙仛鍩烘湰鎯呭喌錛屽畠浣跨殑閫掑綊璺沖嚭鏃犵┓寰幆閫掑綊銆?/SPAN>
Ex 1錛?/SPAN> 1~N鐨勭瘡鍔犺繃紼嬶紝鏁板?/SPAN>1锝?/SPAN>N鐨勭瘡鍔犲彲浠ョ湅鎴愭槸1锝?/SPAN>N錛?/SPAN>1鐨勭瘡鍔犲姞涓?/SPAN>N銆?/SPAN>
public int sum(int num)
{
int result = 0;
if (num == 1){ return 1;
} return result + num + sum(num - 1);
}
榪欓噷鐨勫熀鏈儏鍐靛氨鏄絾num錛濓紳1鐨勬椂鍊欍?/SPAN> 褰撶劧榪欎釜鍙互涓嶇敤閫掑綊鏉ュ鐞嗭紝鐢ㄤ竴涓?/SPAN>for灝辮浜嗭紙鑰屼笖姣旂敤閫掑綊鏇寸洿瑙傦級銆傛垜浠繀欏昏兘鍒ゆ柇浠涔堟椂鍊欎嬌鐢ㄩ掑綊錛屼粈涔堟椂鍊欎笉浣跨敤閫掑綊錛屾墍鏈夐棶棰橀兘鍙互浣跨敤榪唬錛?/SPAN>for寰幆錛夎В鍐抽棶棰樸備笉榪囨湁浜涙儏鍐典笅錛岃凱浠ｆ柟寮忚繃浜庡鏉傦紝瀵規煇浜涢棶棰橈紝閫掑綊鍙互鍐欏嚭鐭皬鑰屼紭闆呯殑浠ｇ爜銆?/SPAN>
鐩存帴閫掑綊鍜岄棿鎺ラ掑綊錛屾柟娉曡皟鐢ㄨ嚜宸憋紝榪欏氨鏄洿鎺ラ掑綊錛堝涓婁釜渚嬪瓙錛夈傛柟娉曡皟鐢ㄥ彟涓涓柟娉曪紝鏈緇堝鑷村啀璋冪敤鍘熸柟娉曘傝繖灝辨槸闂存帴閫掑綊銆?/SPAN>
娌沖唴濉旈棶棰橈紙Towers of Hanoi錛夛紙鍙互涓婄綉鎵炬壘榪欎釜緇忓吀闂鐨勬弿榪幫級
瑙勫垯錛?/SPAN>
l 涓嬈″彧鑳界Щ鍔ㄤ竴寮犲渾鐩?/SPAN>
l 涓嶈兘灝嗗ぇ鐩樻斁鍦ㄥ皬鐩樼殑涓婃柟
l 闄や簡閭ｅ紶鍦ㄦ煴瀛愪箣闂存惉鍔ㄧ殑鍦嗙洏涔嬪錛屾墍鏈夊渾鐩橀兘蹇呴』鍦ㄦ煇鏍規煴瀛愪笂
絳栫暐錛?/SPAN>
l 灝嗘渶涓婃柟鐨?/SPAN>N錛?/SPAN>1寮犲渾鐩樹粠鏈鍒濈殑鏌卞瓙縐誨埌閭ｆ牴澶氬鐨勬煴瀛愪笂
l 灝嗘渶澶х殑鍦嗙洏浠庢渶鍒濈殑鏌卞瓙縐誨姩鍒版渶緇堢殑鏌卞瓙涓?/SPAN>
l 鍐嶅皢閭ｄ釜澶氬嚭鏌卞瓙涓婄殑N錛?/SPAN>1寮犲渾鐩樼Щ鍒版渶緇堢殑鏌卞瓙涓?/SPAN>
Code錛?BR>
public class TowersOfHanoi{ private int totalDisks; // ------------------------------------------------------ // Sets up the puzzle with the specified number of disks // ------------------------------------------------------ public TowersOfHanoi(int disks){ this.totalDisks = disks; } // ---------------------------------------------------------- // Performs the initial call to moveTower to solve the puzzle. // Moves the disks from tower 1 to tower 3 using tower 2 // ---------------------------------------------------------- public void solve(){ moveTower(totalDisks, 1, 3,2); } // ----------------------------------------------------------------- // Moves the specified number of disks from one tower to another by // moving a subtower of n-1 disks out of the way, moving one disk, // then moving the subtower back, Base case of 1 disk. // ----------------------------------------------------------------- private void moveTower(int numDisks, int start, int end, int temp) { if (numDisks == 1){ moveOneDisk(start, end); }else{ moveTower(numDisks-1, start, temp, end); moveOneDisk(start, end); moveTower(numDisks-1, temp, end, start); } } private void moveOneDisk(int start, int end) { System.out.println("Move one disk from " + start + " to " + end); } }]]>