拆分帕斯卡尔情况下字符串转换成逻辑组字 [英] Split a Pascal-case string into logical set of words

问题描述

我想借一个Pascal-套管串像CountOfWidgets，并将其转换成C＃中一些更人性化，如窗口小部件的计数。多个相邻的大写字符应保持不变。什么是做到这一点的最有效方法。

I would like to take a pascal-cased string like "CountOfWidgets" and convert it into something more user-friendly like "Count of Widgets" in C#. Multiple adjacent uppercase characters should be left intact. What is the most efficient way to do this?

注意：http://stackoverflow.com/questions/155303/net-how-can-you-split-一个大写字母分隔字符串 - 到 - 一个阵列

推荐答案

不知道有效率的，但在至少它的简洁：

Don't know about efficient but at least it's terse:

Regex r = new Regex("([A-Z]+[a-z]+)");
string result = r.Replace("CountOfWidgets", m => (m.Value.Length > 3 ? m.Value : m.Value.ToLower()) + " ");

这篇关于拆分帕斯卡尔情况下字符串转换成逻辑组字的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！