1

我想制作包含按字母顺序排列的字符串的排序列表，仅混合字母和数字以及数字。我的客户要求这样排序：

排序在 tablelist 类型对象中包含 Item Code: 111,111A,222,411G,300,411Z,G411,AG500,A111,AZ600,ABQ,ZZZ,AAN 等

所需结果：首先显示数字（如 111 然后 222 然后 300 等...）接下来将是带字母的数字（例如 111A 然后 411G 然后 411Z 等...）下一个带数字的字母（例如 A111 然后 G411 然后 AG500 然后 AZ600 等. ...) 仅下一个字母（如 AAN 然后 ABQ 然后 ZZZ 等....）

所以字符串可以是任何东西。但我想根据需要的结果进行排序。所以请帮我解决这个问题。

4

2 回答 2

3 
unsortedStringList.Sort(new AlphanumComparatorFastString());

字母比较器：

    public class AlphanumComparatorFastString : IComparer<String>
    {
        public int Compare(string s1, string s2)
        {
            if (s1 == null)
                return 0;

            if (s2 == null)
                return 0;

            int len1 = s1.Length;
            int len2 = s2.Length;
            int marker1 = 0;
            int marker2 = 0;

            // Walk through two the strings with two markers.
            while (marker1 < len1 && marker2 < len2)
            {
                char ch1 = s1[marker1];
                char ch2 = s2[marker2];

                // Some buffers we can build up characters in for each chunk.
                char[] space1 = new char[len1];
                int loc1 = 0;
                char[] space2 = new char[len2];
                int loc2 = 0;

                // Walk through all following characters that are digits or
                // characters in BOTH strings starting at the appropriate marker.
                // Collect char arrays.
                do
                {
                    space1[loc1++] = ch1;
                    marker1++;

                    if (marker1 < len1)
                    {
                        ch1 = s1[marker1];
                    }
                    else
                    {
                        break;
                    }
                } while (char.IsDigit(ch1) == char.IsDigit(space1[0]));

                do
                {
                    space2[loc2++] = ch2;
                    marker2++;

                    if (marker2 < len2)
                    {
                        ch2 = s2[marker2];
                    }
                    else
                    {
                        break;
                    }
                } while (char.IsDigit(ch2) == char.IsDigit(space2[0]));

                // If we have collected numbers, compare them numerically.
                // Otherwise, if we have strings, compare them alphabetically.
                string str1 = new string(space1);
                string str2 = new string(space2);

                int result;

                if (char.IsDigit(space1[0]) && char.IsDigit(space2[0]))
                {
                    int thisNumericChunk = int.Parse(str1);
                    int thatNumericChunk = int.Parse(str2);
                    result = thisNumericChunk.CompareTo(thatNumericChunk);
                }
                else
                {
                    result = str1.CompareTo(str2);
                }

                if (result != 0)
                {
                    return result;
                }
            }
            return len1 - len2;
        }
    }

如在http://www.dotnetperls.com/alphanumeric-sorting上找到的

于 2012-08-10T06:46:02.383 回答
2

试试这个：

var text = "111,111A,222,411G,300,411Z,G411,AG500,A111,AZ600,ABQ,ZZZ,AAN";
var list = text.Split(',').ToList();
var result = list.OrderBy(i => i, new StringCompare());
foreach (var item in result)
{
    Console.WriteLine(item);
}

字符串比较类：

class StringCompare : IComparer<string>
{
    string[] exps = new[] { @"^\d+$", @"^\d+[a-zA-Z]+$", @"^[a-zA-Z]\d+$", @"^[a-zA-Z]+\d+$" };
    public int Compare(string x, string y)
    {
        for (int i = 0; i < exps.Length; i++)
        {
            var isNumberx = Regex.IsMatch(x, exps[i]);
            var isNumbery = Regex.IsMatch(y, exps[i]);

            if (isNumberx && isNumbery)
                return string.Compare(x, y);
            else if (isNumberx)
                return -1;
            else if (isNumbery)
                return 1;
            //return string.Compare(x, y);
        }
        return string.Compare(x, y);
    }
}

你会得到：

111
222
300
111A
411G
411Z
A111
G411
AG500
AZ600
AAN
ABQ
ZZZ
于 2012-08-10T06:42:47.703 回答