基于字符串匹配的List<string>搜索

using System;
using System.Collections.Generic;

public class Program
{
    public static void Main()
    {
        List<string> list = new List<string> { "apple", "banana", "cherry", "date" };
        string pattern = "cherry";

        if (SearchExactMatch(list, pattern))
        {
            Console.WriteLine($"Pattern '{pattern}' found in the list.");
        }
        else
        {
            Console.WriteLine($"Pattern '{pattern}' not found in the list.");
        }
    }

    public static bool SearchExactMatch(List<string> list, string pattern)
    {
        foreach (var item in list)
        {
            if (item == pattern)
            {
                return true;
            }
        }
        return false;
    }
}

using System;
using System.Collections.Generic;

public class Program
{
    public static void Main()
    {
        List<string> list = new List<string> { "apple", "banana", "cherry", "date" };
        string pattern = "cherry";

        if (KMPSearch(list, pattern))
        {
            Console.WriteLine($"Pattern '{pattern}' found in the list.");
        }
        else
        {
            Console.WriteLine($"Pattern '{pattern}' not found in the list.");
        }
    }

    public static bool KMPSearch(List<string> list, string pattern)
    {
        int[] lps = ComputeLPSArray(pattern);
        foreach (var item in list)
        {
            if (KMPSearchPattern(item, pattern, lps))
            {
                return true;
            }
        }
        return false;
    }

    private static int[] ComputeLPSArray(string pattern)
    {
        int[] lps = new int[pattern.Length];
        int len = 0;
        int i = 1;
        while (i < pattern.Length)
        {
            if (pattern[i] == pattern[len])
            {
                len++;
                lps[i] = len;
                i++;
            }
            else
            {
                if (len != 0)
                {
                    len = lps[len - 1];
                }
                else
                {
                    lps[i] = 0;
                    i++;
                }
            }
        }
        return lps;
    }

    private static bool KMPSearchPattern(string text, string pattern, int[] lps)
    {
        int i = 0;
        int j = 0;
        while (i < text.Length)
        {
            if (pattern[j] == text[i])
            {
                i++;
                j++;
            }
            if (j == pattern.Length)
            {
                return true;
            }
            else if (i < text.Length && pattern[j] != text[i])
            {
                if (j != 0)
                {
                    j = lps[j - 1];
                }
                else
                {
                    i++;
                }
            }
        }
        return false;
    }
}