判斷字符串strA是不是strB的真子集字符串,思想是避免兩個嵌套循環,能夠根據char值判斷,對比值的大小(我這裏假定大字符串是一個遞增有序字符串),子串值大於父串值則索引後移,反之遷移;git
string strFather = "abcdefs"; string strSon = "bbdsu"; bool result = checkIsSon(strFather, strSon); if (result) System.Console.WriteLine("是真子集"); else System.Console.WriteLine("非真子集"); #region 字符串是不是另外一個字符串的真子集 static bool checkIsSon(string strFather, string strSon) { int finalCount = 0; char[] arrFather = strFather.ToArray(); char[] arrSon = strSon.ToArray(); for (int i = 0; i < arrSon.Length; i++) { int son = arrSon[i]; int father = arrFather[i]; if (son == father) { finalCount += 1; } else if (son >= father)//向後找 { for (int j = i; j < arrFather.Length; j++) { if (son == arrFather[j]) { finalCount += 1; break; } if (arrFather[j] > son) { return false; } } } else if (son < father)//向前找 { for (int j = i; j > i; j--) { if (son == arrFather[j]) { finalCount += 1; break; } if (arrFather[j] < son) { return false; } } } } return finalCount == arrSon.Length; } #endregion
非真子集.net