Eliminate consecutive duplicates of list elements

Question

Is there a "nice" way to eliminate consecutive duplicates of list elements?

Example:

["red"; "red"; "blue"; "green"; "green"; "red"; "red"; "yellow"; "white"; "white"; "red"; "white"; "white"]  

should become

["red"; "blue"; "green"; "red"; "yellow"; "white"; "red"; "white"] 

--By "nice" I mean most readable and understandable to a new user and fast execution :)

Answer 1

A simple and very readable solution:

List<string> results = new List<string>(); foreach (var element in array) {     if(results.Count == 0 || results.Last() != element)         results.Add(element); } 

Answer 2

You can roll your own, linq-style.

// For completeness, this is two methods to ensure that the null check  // is done eagerly while the loop is done lazily. If that's not an issue,  // you can forego the check and just use the main function.  public static IEnumerable<T> NonConsecutive<T>(this IEnumerable<T> input) {   if (input == null) throw new ArgumentNullException("input");   return NonConsecutiveImpl(input); }  static IEnumerable<T> NonConsecutiveImpl<T>(this IEnumerable<T> input) {    bool isFirst = true;    T last = default(T);    foreach (var item in input) {       if (isFirst || !object.Equals(item, last)) {           yield return item;           last = item;           isFirst = false;       }    } } 

And use as

array.NonConsecutive().ToArray() 

The advantage is that it's lazily evaluated, so you can use it on any enumeration without having to consume it in its entirety, and chain it with other linq methods (eg: array.Where(i => i != "red").NonConsecutive().Skip(1).ToArray()). If you don't have that requirement and you just want to work with arrays, something like Simon Bartlett's solution might be slightly more performant.

For more information on why it has to be two methods, see here