将汉字数字转换成阿拉伯数字

  前一段时间看一个帖子上在讨论这个算法，跟帖的有一百多人。发的算法也不下十个。不过我觉的这个是做好的一个，总结如下。如有问题往大家校正！

//Number用来映射 一,二,三... Unit用来映射十,百,千...

        struct Number

        {

            publicintthis[char c]

            {

                get

                {

                    switch (c)

                    {

                        case'一':

                            return1;

                        case'二':

                            return2;

                        case'三':

                            return3;

                        case'四':

                            return4;

                        case'五':

                            return5;

                        case'六':

                            return6;

                        case'七':

                            return7;

                        case'八':

                            return8;

                        case'九':

                            return9;

                        case'零':

                            return0;

                        default:

                            return -1;

                    }

                }

            }

        }

        struct Unit

        {

            publicintthis[char c]

            {

                get

                {

                    switch (c)

                    {

                        case'十':

                            return10;

                        case'百':

                            return100;

                        case'千':

                            return1000;

                        case'万':

                            return10000;

                        case'亿':

                            return100000000;

                        default:

                            return1;

                    }

                }

            }

        }

//下面是具体算法部分,思路非常简单就是从右至左分析中文的数字,遇到'位'计记录下来,非'位'就乘以位并加入到结果result中.firstUnit单表第一级位,second代表二级位,例如:三十八万 十是secondUnit,万是firsUnit

class Parser_CNum

        {             

            publiclong Parse(string cnum)

            {

                Unit unit;

                Number number;

                cnum = Regex.Replace(cnum, "//s+", "");

                long firstUnit = 1;                    //一级单位

                long secondUnit = 1;                   //二级单位

                long tmpUnit = 1;

                long result = 0;

                for (int i = cnum.Length - 1; i > -1; --i)

                {

                    tmpUnit = unit[cnum[i]];

                    if (tmpUnit > firstUnit)

                    {

                        firstUnit = tmpUnit;

                        secondUnit = 1;

                        continue;

                    }

                    elseif (tmpUnit > secondUnit)

                    {

                        secondUnit = tmpUnit;

                        continue;

                    }

                    result += firstUnit * secondUnit * number[cnum[i]];

                }

                return result;

          }

        }

//最后测试

publicstaticvoid Main()

        {

            Parser_CNum parser = new Parser_CNum();

            Debug.Assert(parser.Parse("一万二千三百四十五") == 12345, "一万二千三百四十五 解析错误，为：" + parser.Parse("一万二千三百四十五"));

            Debug.Assert(parser.Parse("一千二百零三") == 1203, "一千二百零三 解析错误，为：" + parser.Parse("一千二百零三"));

            Debug.Assert(parser.Parse("一千零三十二") == 1032, "一千零三十二 解析错误，为：" + parser.Parse("一千零三十二"));

            Debug.Assert(parser.Parse("一千二百三十四亿 五千六百七十八万 九千零一") == 123456789001, "一千二百三十四亿 五千六百七十八万 九千零一 解析错误，为：" + parser.Parse("一千二百三十四亿 五千六百七十八万 九千零一"));

        }