• 求出两个字符串中最大长度的相同的子字符串


      1    class Program
      2     {
      3         static void Main(string[] args)
      4         {
      5             string s1 = "abcdefghijklmn";
      6             string s2 = "abc";
      7             string s3 = "bcde";
      8             string s4 = "lmn";
      9             string s5 = "abdef";
     10             string s6 = "bcabcd";
     11             string s7 = "abcdghabcdef";
     12             string s8 = "events/eventinsight/insight";
     13             string s9 = "events";
     14             Console.WriteLine("s1:{0},s1:{1} {2} ", s1, s1, GetMaxSameString(s1, s1));
     15             Console.WriteLine("s1:{0},s2:{1} {2} ", s1, s2, GetMaxSameString(s1, s2));
     16             Console.WriteLine("s2:{0},s3:{1} {2} ", s2, s3, GetMaxSameString(s2, s3));
     17             Console.WriteLine("s3:{0},s4:{1} {2} ", s3, s4, GetMaxSameString(s3, s4));
     18             Console.WriteLine("s4:{0},s5:{1} {2} ", s4, s5, GetMaxSameString(s4, s5));
     19             Console.WriteLine("s1:{0},s6:{1} {2} ", s1, s6, GetMaxSameString(s1, s6));
     20             Console.WriteLine("s1:{0},s7:{1} {2} ", s1, s7, GetMaxSameString(s1, s7));
     21             Console.WriteLine("s8:{0},s9:{1} {2} ", s8, s9, GetMaxSameString(s8, s9));
     22             Console.ReadLine();
     23         }
     24         /// <summary>
     25         /// 得到某一字符在另一字符串中的index数组
     26         /// </summary>
     27         /// <param name="chr">某一字符</param>
     28         /// <param name="str">另一字符串</param>
     29         /// <returns>index数组</returns>
     30         static List<int> GetIndexArr(char chr, string str)
     31         {
     32             List<int> arr = new List<int>();
     33             for (int x = 0, len = str.Length; x < len; x++)
     34             {
     35                 if (chr.Equals(str[x]))
     36                 {
     37                     arr.Add(x);
     38                 }
     39             }
     40             return arr;
     41         }
     42 
     43         /// <summary>
     44         /// 得到某一字符串数组中的最长字符
     45         /// </summary>
     46         /// <param name="list">某一字符串数组</param>
     47         /// <returns>最长字符</returns>
     48         static string GetMaxLenString(List<string> list)
     49         {
     50             string str = "";
     51             if (list.Count > 0)
     52             {
     53                 str = list[0];
     54                 for (int k = 0; k < list.Count; k++)
     55                 {
     56                     if (list[k].Length > str.Length)
     57                     {
     58                         str = list[k];
     59                     }
     60                 }
     61             }
     62             return str;
     63         }
     64 
     65         /// <summary>
     66         /// 得到最大相同长度字符串
     67         /// </summary>
     68         /// <param name="s1">字符串1</param>
     69         /// <param name="s2">字符串2</param>
     70         /// <returns>最大相同长度字符串</returns>
     71         static string GetMaxSameString(string s1, string s2)
     72         {
     73             List<string> list = new List<string>();
     74             int l1, l2;
     75             string maxStr,minStr;
     76             if (s1.Length > s2.Length)
     77             {
     78                 l1 = s1.Length;
     79                 l2 = s2.Length;
     80                 minStr = s2;
     81                 maxStr = s1;
     82             }
     83             else
     84             {
     85                 l1 = s2.Length;
     86                 l2 = s1.Length;
     87                 minStr = s1;
     88                 maxStr = s2;
     89             }
     90 
     91             for (int i = 0; i < l1; i++)
     92             {
     93                 int j = 0;
     94                 string sb = "";
     95                 char chr = maxStr[i];
     96                 List<int> arr = GetIndexArr(chr, s2);
     97                 for (int y = 0; y < arr.Count; y++)
     98                 {
     99                     j = arr[y];
    100                     int k = i;
    101                     while (k < l1 && j < l2)
    102                     {
    103                         if (maxStr[k] == minStr[j])
    104                         {
    105                             sb += minStr[j];
    106                             k++;
    107                         }
    108                         j++;
    109                     }
    110                     if (sb.Length > 0)
    111                     {
    112                         list.Add(sb);
    113                         sb = "";
    114                     }
    115                 }
    116             }
    117             return GetMaxLenString(list);
    118         }
    119     }
  • 相关阅读:
    让应用通过苹果审核出人头地的10个方法
    正则表达式练习 Regex Golf
    Cocos2d-iOS入门知识详解
    Linux C++/Java/Web/OC Socket网络编程
    JAVA-API Dom4J解析xml/OPML & Rome解析RSS & QRCode编码解码
    李开复:做技术还是管理?
    水两道搜索
    利用HttpClient4进行网络通讯
    hdu5698 百度之星2016round2b第3题
    百度之星2016资格赛D,水题
  • 原文地址:https://www.cnblogs.com/cyan/p/3727591.html
Copyright © 2020-2023  润新知