【发布时间】:2011-04-18 14:37:32
【问题描述】:
有谁知道将“第一”、“第十”和“百分之一”等词转换为等效数字的方法?
样品: “第一个”-> 1, “第二”-> 2, “第十” -> 10, “百分之一” -> 100
任何算法都可以,但我是用 C# 编写的。
编辑
它并不漂亮,一次只能用一个词,但它适合我的目的。也许有人可以改进它,但我没时间了。
public static int GetNumberFromOrdinalString(string inputString)
{
string[] ordinalNumberWords = { "", "first", "second", "third", "fourth", "fifth", "sixth", "seventh", "eighth", "ninth", "tenth", "eleventh", "twelfth", "thirteenth", "fourteenth", "fifteenth", "sixteenth", "seventeenth", "eighteenth", "nineteenth", "twentieth" };
string[] ordinalNumberWordsTens = { "", "tenth", "twentieth", "thirtieth", "fortieth", "fiftieth", "sixtieth", "seventieth", "eightieth", "ninetieth" };
string[] ordinalNumberWordsExtended = {"hundredth", "thousandth", "millionth", "billionth" };
if (inputString.IsNullOrEmpty() || inputString.Length < 5 || inputString.Contains(" ")) return 0;
if (ordinalNumberWords.Contains(inputString) || ordinalNumberWordsTens.Contains(inputString))
{
var outputMultiplier = ordinalNumberWords.Contains(inputString) ? 1 : 10;
var arrayToCheck = ordinalNumberWords.Contains(inputString) ? ordinalNumberWords : ordinalNumberWordsTens;
// Use the loop counter to get our output integer.
for (int x = 0; x < arrayToCheck.Count(); x++)
{
if (arrayToCheck[x] == inputString)
{
return x * outputMultiplier;
}
}
}
// Check if the number is one of our extended numbers and return the appropriate value.
if (ordinalNumberWordsExtended.Contains(inputString))
{
return inputString == ordinalNumberWordsExtended[0] ? 100 : inputString == ordinalNumberWordsExtended[1] ? 1000 : inputString == ordinalNumberWordsExtended[2] ? 1000000 : 1000000000;
}
return 0;
}
【问题讨论】:
-
您的意思是,将
231转换为1 + 30 + 200? -
@Ruel,不,我认为 OP 的意思是 1 -> “第一”,10 -> “第十”,100 -> “百分之一”
-
你想用这个多高?
-
我明白了,我不知道任何现有的类/算法。这会很痛苦,但必须有人编写代码。
-
@Kirk 我认为 OP 想要反过来
标签: c# string algorithm numeric ordinals