<方法一>int[] arr ={ 12, 12, 12, 13, 13, 14, 14, 14, 14, 0 }; Dictionary<int, int> dic = new Dictionary<int, int>(); foreach (int i in arr) { if (dic.ContainsKey(i)) dic = dic + 1; else dic.Add(i, 1); } //查看结果 foreach (int j in dic.Keys) { richTextBox2.Text += j.ToString() + “的个数有: ” + dic[j] + “个\n”; } <方法二>int[] arr = { 12, 12, 12, 13, 13, 14, 14, 14, 14, 0 }; var query = from a in arr group arr by a into g orderby g.Count() select new { g.Key, count = g.Count() }; foreach (var i in query) { Console.WriteLine(“{0}出现{1}次”, i.Key, i.count); } |
|
来自: 看风景D人 > 《面试笔试常用算法》