c#语言中数组的下标是从( )开始.,NET 在一个数组中查找另一个数组所在起始

///

///如果 search 在 dist 中顺序出现而不要求连续出现，那代码应该如何修改？如何计算这种匹配的可能性？///例如：///数组 search=[5,4,6],在数据 dist=[1,5,5,4,3,4,5,6]的起始位置是1///(因为dist下标{1,3,7}和下标{1,5,7}的元素都等于 search=[5,4,6]，故有两种可能)///

private static voidindexOf()

{var search = new int[] { 5, 4, 6};

Console.WriteLine($"连续出现的数组:{string.Join("-", search)}");var dist = new int[] { 1, 5, 5, 4, 3, 4, 5, 6};

Console.WriteLine($"需要比对的数组:{string.Join("-", dist)}");var dictionary = new Dictionary>();//按照数组顺序初始化字典

foreach (var item insearch)

{

dictionary.Add(item,new List());

}//把search中元素的下标记录下来

for (int i = 0; i < dist.Length; i++)

{var key =dist[i];if (Array.IndexOf(search, key) > -1)

{if(dictionary.ContainsKey(key))

{

dictionary[key].Add(i);

}

}

}var group = new List>();

Console.WriteLine("分组前：");foreach (var key indictionary.Keys)

{

Console.WriteLine($"Key:{key}\t下标集合:{string.Join("-", dictionary[key])}");

}

Add(new List(), -1, 0, search, dictionary, group);

Console.WriteLine("分组后：");foreach (var item ingroup)

{

Console.WriteLine($"下标集合:{string.Join("-", item)}");

}

}///

///递归添加///

/// 需要添加的集合

/// 上一次的key，当前循环key要比上一次大

/// 下标

///

///

///

private static void Add(List list, int parentKey, int index, int[] search, Dictionary> dictionary, List>group)

{if (search.Count() <=index)

{//匹配项超过数组长度，终止

group.Add(list);return;

}//当前下标的值

var key =search[index];if(dictionary.ContainsKey(key))

{var itemList =dictionary[key];//循环值

for (int j = 0; j < itemList.Count(); j++)

{var itemKey =itemList[j];//当前循环key要比上一次大

if (itemKey

{return;

}var clone =Clone(list);

clone.Add(itemKey);

Add(clone, itemKey, index+ 1, search, dictionary, group);

}

}

}///

///克隆///

///

///

private static List Clone(Listlist)

{var clone = new List();foreach (var item inlist)

{

clone.Add(item);

}returnclone;

}