ajianchina的博客

适用于闭环状态下各节点间距相等，计算从其中一个节点去1个或多个目标节点的最短路径，最短路径可以折返取得。下面是一个有着10000个节点的闭环，从其中一个节点去往9个目标节点的示例。static void Main(string[] args){ int x = 3;//起点 int[] arr = { 2, 2000, 4900, 9990, 6001, 200, 400

class Program { static void Main(string[] args) { string[] sArr = new string[] { "a", "b", "c", "d", "e" }; List outList = addList(sArr.Select(p => new stri

public delegate bool Contrast(T t1, T t2);public static void Sequence(T[] items, Contrast contrast){ for (int i = 0; i < items.Length; i++) { for (int j = i + 1; j < items.Length; j+

public static bool CheckVin(string vin){ if (vin == null || vin.Length != 17) return false; int symbol, weight, verify, sum = 0; bool isRepeat = true; if (vin[8] &gt;= 48 &amp;&amp; ...

public static bool CheckSocialCreditCode(string code){ if (code?.Length != 18) return false; code = code.ToUpper(); int[] factor = { 1, 3, 9, 27, 19, 26, 16, 17, 20, 29, 25, 13, 8,