What is the LINQ way to implode/join a string array? [duplicate]

Question

What is the most efficient way to write the old-school:

StringBuilder sb = new StringBuilder(); if (strings.Count > 0) {     foreach (string s in strings)     {         sb.Append(s + ", ");     }     sb.Remove(sb.Length - 2, 2); } return sb.ToString(); 

...in LINQ?

Answer 1

This answer shows usage of LINQ (Aggregate) as requested in the question and is not intended for everyday use. Because this does not use a StringBuilder it will have horrible performance for very long sequences. For regular code use String.Join as shown in the other answer

Use aggregate queries like this:

string[] words = { "one", "two", "three" }; var res = words.Aggregate(    "", // start with empty string to handle empty list case.    (current, next) => current + ", " + next); Console.WriteLine(res); 

This outputs:

, one, two, three

An aggregate is a function that takes a collection of values and returns a scalar value. Examples from T-SQL include min, max, and sum. Both VB and C# have support for aggregates. Both VB and C# support aggregates as extension methods. Using the dot-notation, one simply calls a method on an IEnumerable object.

Remember that aggregate queries are executed immediately.

More information - MSDN: Aggregate Queries

---

If you really want to use Aggregate use variant using StringBuilder proposed in comment by CodeMonkeyKing which would be about the same code as regular String.Join including good performance for large number of objects:

 var res = words.Aggregate(      new StringBuilder(),       (current, next) => current.Append(current.Length == 0? "" : ", ").Append(next))      .ToString(); 

Answer 2

return string.Join(", ", strings.ToArray()); 

---

In .Net 4, there's a new overload for string.Join that accepts IEnumerable<string>. The code would then look like:

return string.Join(", ", strings);