C＃：如果数组不包含字符串，则将字符串添加到数组

Question

I have a lot of string arrays. From all these string arrays, I want to create an array of unique strings. At the moment I do it like this:

string[] strings = {};

while(running)
{
   newStringArrayToAdd[] = GetStrings();
   strings = strings.Concat(newStringArrayToAdd).ToArray();
}

uniqueStrings = strings.Distinct.ToArray();

This works but it is very very slow since I have to keep the strings variable in memory which gets very huge. Therefore I'm looking for a way to check on the fly if a string is in uniqueStrings and if not add it immediately. How can I do that?

Answer 1

Consider using a HashSet<string> instead of an array. It will do nothing if the string already exists in the set:

HashSet<string> strings = new HashSet<string>();

strings.Add("foo");
strings.Add("foo");

strings.Count // 1

The UnionWith method will be very useful in your example code:

HashSet<string> strings = new HashSet<string>();

while(running)
{
   string[] newStringArrayToAdd = GetStrings();
   strings.UnionWith(newStringArrayToAdd);
}

Answer 2

Use a HashSet instead. Like this:

HashSet<string> uniqueStrings = new HashSet<string>();

for loop...
if (!uniqueStrings.Contains(newStringToAdd))
{
  uniqueStrings.Add(newStringToAdd);
}

To get the array afterwards:

var uniqueStringArray = uniqueStrings.ToArray();

Answer 3

Can you keep a list of the hashes of the strings?

When adding a new string, if its hash is not already in the list, you know its unique.

If the hash is present it could be unique, or it might be a hash-collision, so you have to check the long way. But that should be a relatively rare case.

Answer 4

You can use Union

string[] result = strings.Union(strings2).ToArray();

Thus change your code as

string[] strings = {};

while(running)
{
   newStringArrayToAdd[] = GetStrings();
   strings = strings.Union(newStringArrayToAdd).ToArray();
}

// No need for this line as strings will be unique
//uniqueStrings = strings.Distinct.ToArray();

As per msdn

This method excludes duplicates from the return set. This is different behavior to the Concat method, which returns all the elements in the input sequences including duplicates.

Answer 5

You can use a Hashset that will do the filtering for you:

HashSet<string> strings = new HashSet<string>();

for loop....
  foreach (string s in newStringArrayToAdd)
    strings.Add(s);
end of loop:

uniqueStrings = strings.ToArray();

Answer 6

use a HashSet<string> . Here is more information on how lists work: http://msdn.microsoft.com/en-us/library/bb359438.aspx

Answer 7

Have you considered storing the strings in a HashSet rather than an array? The hashset will guarantee uniqueness in constant time every time you add to it.

var strings = new HashSet<string>();
strings.Add("abc");
strings.Add("abc");
strings.Count // is 1