繁体   English   中英

如何找到数组中最大的索引器

[英]How do i find the largest indexer in an array

我正在开发一个需要在循环中输入数组中的值的程序。 我需要一种方法来找到最大的索引:

string[] stuff = { "Headphones", "Pen", "stapler" };
string[] alreadysaid = { "Headphones" };

foreach (string stuffs in stuff)
{
    if (alreadysaid.Contains(stuffs))
    {
        Console.WriteLine("already said");
    }
    else
    {
        Console.WriteLine(stuffs);
        // add said element to alreadysaid
    }
}

我建议使用HashSet<string>而不是string[] for alreadysaid 现在你所要做的就是Add stuffs

HashSet<string> alreadysaid = new HashSet<string>() { "Headphones" };

foreach (string stuffs in stuff) 
{
    if (alreadysaid.Add(stuffs)) 
    {
        Console.WriteLine(stuffs);
    }
    else 
    {
        Console.WriteLine("already said");
    }
}

每当您想将alreadysaidstring[]您都可以使用Linq

string[] arraySaid = alreadysaid.ToArray();

使用LINQ来做到这一点

int maxIndex = stuff.ToList().IndexOf(stuff.Max());

暂无
暂无

声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.

 
粤ICP备18138465号  © 2020-2024 STACKOOM.COM