列表中最大的子组，但是确定性的

Question

In a list of eg 100 items with an integer value IntValue , I can easily group by these values.
var groupby = list.GroupBy(i => i.IntValue);

What is the best Linq-way to find the largest group in the groupby variable now?

It must be deterministic, so when there are two largest groups in the list with the same number of items, I would want to select te lowest value of IntValue .

Answer 1

Just do some ordering and take the first one:

var group = groupby.OrderByDescending(g => g.Count())
                   .ThenBy(g => g.Key)
                   .First();

You could achieve the same using syntax-based query:

var group = (from g in groupby
             order g by g.Count() descending, g.Key
             select g).First();