传送门 经 典 老 番 最近算法课讲到递归，顺手写一点经典的回溯题来巩固基础。 回溯是一种通过枚举出所有可能情况来得到解答的算法，很直白也很经典。当确定当前情况不是解或不是最后一个解时，算法会逐步退回到之前的步骤，通过更改部分组成来枚举下一种情况。 放在这道题里，要得出n个数的全排列，不难得出它的递归思路，设cur为当……
来自分类：做题
你已到达了世界的尽头(｡・`ω´･)！
-
edisoncgh
最近访客
评论
-
于「3年前」在「互换友链」中说:
-
于「3年前」在「互换友链」中说:( ,,´･ω･)ﾉ"(´っω･｀｡)
-
于「3年前」在「poj2524：Ubiquitous Religions」中说:Hello there! This is my 1st comment here so I just wanted to give a quick shout out and say I really enjoy reading through your articles. Can you suggest any other blogs/websites/forums that cover the same subjects? Thank you!
-
于「3年前」在「C++Trie树(字典树)」中说:I wish to point out my passion for your generosity giving support to people who require help with your situation. Your special commitment to passing the solution around appears to be pretty significant and have usually made people like me to get to their aims. The important facts signifies a whole lot a person like me and a whole lot more to my fellow workers. Many thanks; from everyone of us. Frannie Prentiss Langille
-
于「3年前」在「C++Trie树(字典树)」中说:Awesome post. I am a regular visitor of your blog and appreciate you taking the time to maintain the excellent site. I will be a frequent visitor for a long time. Manon Cornie Elwina
-
