C# 哈拉雷) { WriteLine(“这个字符“+r+”在字符串中出现的时间是“+arr[r]+”); } }
我从下面学到了所有这些,供您参考。很好的解决方案。我认为这与xanatos的第二个答案相同,但有一个额外的空集合检查,这很好。顺便说一句,最常见的是模式,而不是中间值。@nawfal,我想知道为什么我犯了这么愚蠢的错误。不管怎么说,这与阿尔宾的答案基本相同,撇开空头支票和GenerisSCM不谈。我不明白的是,为什么一个受欢迎但低劣的答案总是能赢得选票。乔德尔,很简单,对大多数人来说,第一眼看到它是最短最甜的。或者可能这就是他们想要的功能;)+1对于基准测试:)@nawfal,修复了它。我必须把我的代码转录到这里,它很容易出现我的人为错误。我几乎有足够的兴趣做一个性能比较。“里面可能没有多少。”如果你有,乔德雷尔会把它贴出来。我也会从我这边试试。这段代码显示了每个字母的频率,而不是问题中所问的最大频率。欢迎来到Stack Overflow,感谢您发布答案!通常,没有任何解释的代码答案会被删除/否决。我建议您在代码中添加一些解释,以便将来的查看者能够理解。请注意,.NET Core现在有一个forC# 哈拉雷) { WriteLine(“这个字符“+r+”在字符串中出现的时间是“+arr[r]+”); } },c#,linq,C#,Linq,我从下面学到了所有这些,供您参考。很好的解决方案。我认为这与xanatos的第二个答案相同,但有一个额外的空集合检查,这很好。顺便说一句,最常见的是模式,而不是中间值。@nawfal,我想知道为什么我犯了这么愚蠢的错误。不管怎么说,这与阿尔宾的答案基本相同,撇开空头支票和GenerisSCM不谈。我不明白的是,为什么一个受欢迎但低劣的答案总是能赢得选票。乔德尔,很简单,对大多数人来说,第一眼看到它是最短最甜的。或者可能这就是他们想要的功能;)+1对于基准测试:)@nawfal,修复了它。我必须把
OrderBy(…).First()
,所以这现在是O(n)而不是O(n log n)仅256个字符?试试unicode。另外,问题是如何在LINQ中实现。
"abbbbccd"
input.GroupBy(x => x).OrderByDescending(x => x.Count()).First().Key
string testString = "abbbbccd";
var charGroups = (from c in testString
group c by c into g
select new
{
c = g.Key,
count = g.Count(),
}).OrderByDescending(c => c.count);
foreach (var group in charGroups)
{
Console.WriteLine(group.c + ": " + group.count);
}
Dictionary<char, int> dict = new Dictionary<char, int>();
int max = 0;
foreach (char c in "abbbbccccd")
{
int i;
dict.TryGetValue(c, out i);
i++;
if (i > max)
{
max = i;
}
dict[c] = i;
}
foreach (KeyValuePair<char, int> chars in dict)
{
if (chars.Value == max)
{
Console.WriteLine("{0}: {1}", chars.Key, chars.Value);
}
}
var str = "abbbbccccd";
var res = str.GroupBy(p => p).Select(p => new { Count = p.Count(), Char = p.Key }).GroupBy(p => p.Count, p => p.Char).OrderByDescending(p => p.Key).First();
foreach (var r in res) {
Console.WriteLine("{0}: {1}", res.Key, r);
}
public char MostOccurringCharInString(string charString)
{
int mostOccurrence = -1;
char mostOccurringChar = ' ';
foreach (char currentChar in charString)
{
int foundCharOccreence = 0;
foreach (char charToBeMatch in charString)
{
if (currentChar == charToBeMatch)
foundCharOccreence++;
}
if (mostOccurrence < foundCharOccreence)
{
mostOccurrence = foundCharOccreence;
mostOccurringChar = currentChar;
}
}
return mostOccurringChar;
}
public static IEnumerable<T> Mode<T>(
this IEnumerable<T> source,
IEqualityComparer<T> comparer = null)
{
var counts = source.GroupBy(t => t, comparer)
.Select(g => new { g.Key, Count = g.Count() })
.ToList();
if (counts.Count == 0)
{
return Enumerable.Empty<T>();
}
var maxes = new List<int>(5);
int maxCount = 1;
for (var i = 0; i < counts.Count; i++)
{
if (counts[i].Count < maxCount)
{
continue;
}
if (counts[i].Count > maxCount)
{
maxes.Clear();
maxCount = counts[i].Count;
}
maxes.Add(i);
}
return maxes.Select(i => counts[i].Key);
}
IOrderedEnumerable<KeyValuePair<int, IEnumerable<T>>>Frequency<T>(
this IEnumerable<T> source,
IComparer<T> comparer = null)
{
return source.GroupBy(t => t, comparer)
.GroupBy(
g => g.Count(),
(k, s) => new KeyValuePair<int, IEnumerable<T>>(
k,
s.Select(g => g.First())))
.OrderByDescending(f => f.Key);
}
var mostFrequent = string.Empty.Frequency().FirstOrDefault();
var mostFrequent = "abbbbccd".Frequency().First();
var mostFrequent = "aaacbbbcdddceee".Frequency().First();
public static IEnumerable<T> Mode<T>(
this IEnumerable<T> source,
IEqualityComparer<T> comparer = null)
{
var mode = source.GroupBy(
t => t,
(t, s) => new { Value = t, Count = s.Count() }, comparer)
.GroupBy(f => f.Count)
.OrderbyDescending(g => g.Key).FirstOrDefault();
return mode == null ? Enumerable.Empty<T>() : mode.Select(g => g.Value);
}
var mostFrequent = string.Empty.Mode();
var mostFrequent = "abbbbccd".Mode();
var mostFrequent = "aaacbbbcdddceee".Mode();
public static IEnumerable<char> GetMostFrequentCharacters(this string str)
{
if (string.IsNullOrEmpty(str))
return Enumerable.Empty<char>();
var groups = str.GroupBy(x => x).Select(x => new { Letter = x.Key, Count = x.Count() }).ToList();
var max = groups.Max(g2 => g2.Count);
return groups.Where(g => g.Count == max).Select(g => g.Letter);
}
public static IEnumerable<T> Mode<T>(this IEnumerable<T> input)
{
var dict = input.ToLookup(x => x);
if (dict.Count == 0)
return Enumerable.Empty<T>();
var maxCount = dict.Max(x => x.Count());
return dict.Where(x => x.Count() == maxCount).Select(x => x.Key);
}
var modes = "".Mode().ToArray(); //returns { }
var modes = "abc".Mode().ToArray(); //returns { a, b, c }
var modes = "aabc".Mode().ToArray(); //returns { a }
var modes = "aabbc".Mode().ToArray(); //returns { a, b }
this - 280 ms
Jodrell's - 900 ms
this - 1800 ms
Jodrell's - 3200 ms
this - 3200 ms
Jodrell's - 3000 ms
class CharCount
{
public void CountCharacter()
{
int n;
Console.WriteLine("enter the no. of elements: ");
n = Convert.ToInt32(Console.ReadLine());
char[] chararr = new char[n];
Console.WriteLine("enter the elements in array: ");
for (int i = 0; i < n; i++)
{
chararr[i] = Convert.ToChar(Console.ReadLine());
}
Dictionary<char, int> count = chararr.GroupBy(x => x).ToDictionary(g => g.Key, g => g.Count());
foreach(KeyValuePair<char, int> key in count)
{
Console.WriteLine("Occurrence of {0}: {1}",key.Key,key.Value);
}
Console.ReadLine();
}
}
//find most occuring character and count from below string
string totest = "abcda12Zernn111y";
string maxOccuringCharacter = "";
int maxOccurence = 0;string currentLoopCharacter = ""; string updatedStringToTest = "";int cnt = 0;
for (int i = 0; i < totest.Length; i++)
{
currentLoopCharacter = totest[i].ToString();
updatedStringToTest = totest.Replace(currentLoopCharacter, "");
cnt = totest.Length - updatedStringToTest.Length;
if (cnt > maxOccurence)
{
maxOccuringCharacter = currentLoopCharacter;
maxOccurence = cnt;
}
totest = updatedStringToTest;
}
Console.WriteLine("The most occuring character is {0} and occurence was {1}", maxOccuringCharacter, maxOccurence.ToString());
Console.ReadLine();
#simplified expression using LINQ#
string text = "abccdeeef";
int length = text.ToCharArray().GroupBy(x => x).OrderByDescending(x =>
x.Count()).First().Count();
var str = "abbbbccd";
var chrArr = str.ToCharArray();
Dictionary<char, int> dic = new Dictionary<char, int>();
foreach (char a in chrArr)
{
if (dic.ContainsKey(a))
dic[a]++;
else
dic.Add(a, 1);
}
int count = dic.Values.Max();
char val = dic.Where(d => d.Value == count).FirstOrDefault().Key;
private static void CalculateMaxCharCountUsingArray(string actualString)
{
char[] charArray = actualString.ToCharArray();
int[] arr = new int[256];
int maxCount = 0;
char maxChar = ' ';
foreach (var r in charArray)
{
arr[r] = arr[r] + 1;
if (maxCount < arr[r])
{
maxCount = arr[r];
maxChar = r;
}
}
Console.WriteLine("This character " + maxChar + " that appeared maximum times : " + maxCount);
IEnumerable<char> distinctCharArray = charArray.Distinct();
foreach(var r in distinctCharArray)
{
Console.WriteLine("This character " + r + " that appeared times " + arr[r] + " in a string");
}
}