public static int Fibonacci(int n){if (n < 0) return -1;if (n == 0) return 0;if (n == 1) return 1;return Fibonacci(n - 1) + Fibonacci(n - 2);}

public static void hannoi(int n, string from, string buffer, string to){if (n == 1){Console.WriteLine("Move disk " + n + " from " + from + " to " + to);}else{hannoi(n - 1, from, to, buffer);Console.WriteLine("Move disk " + n + " from " + from + " to " + to);hannoi(n - 1, buffer, from, to);}}

public static void Permutation(string[] nums, int m, int n){string t;if (m < n - 1){Permutation(nums, m + 1, n);for (int i = m + 1; i < n; i++){//可抽取Swap方法t = nums[m];nums[m] = nums[i];nums[i] = t;Permutation(nums, m + 1, n);//可抽取Swap方法t = nums[m];nums[m] = nums[i];nums[i] = t;}}else{for (int j = 0; j < nums.Length; j++){Console.Write(nums[j]);}Console.WriteLine();}}

static void Main(string[] args){Nums = new string[] { "a", "b", "c" };Permutation(Nums, 0, Nums.Length);
         Console.ReadKey();}

   public class Node{public string value { get; set; }public Node nextNode { get; set; }public Node(string value){this.value = value;this.nextNode = null;}}

public static List<Node> NodeList = new List<Node>();

  public static void Permutation(string[] nums, int m, int n){string t;if (m < n - 1){Permutation(nums, m + 1, n);for (int i = m + 1; i < n; i++){//可抽取Swap方法t = nums[m];nums[m] = nums[i];nums[i] = t;Permutation(nums, m + 1, n);//可抽取Swap方法t = nums[m];nums[m] = nums[i];nums[i] = t;}}else{Node root = null;Node currentNode;for (int j = 0; j < nums.Length; j++){currentNode = new Node(nums[j]);currentNode.nextNode = root;root = currentNode;}NodeList.Add(root);}}

作者：雲霏霏

QQ交流群：243633526

博客地址：http://www.cnblogs.com/yunfeifei/

声明：本博客原创文字只代表本人工作中在某一时间内总结的观点或结论，与本人所在单位没有直接利益关系。非商业，未授权，贴子请以现状保留，转载时必须保留此段声明，且在文章页面明显位置给出原文连接。

如果大家感觉我的博文对大家有帮助，请推荐支持一把，给我写作的动力。