最大匹配字符串LCS,The Longest Common Substring
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 | public enum BackTracking { UP, LEFT, NEITHER, UP_AND_LEFT } public abstract class LCSBaseMatch { /// <summary> /// 设置连续字符的匹配值 /// </summary> /// <param name="length"></param> /// <returns></returns> protected virtual int ConsecutiveMeasure( int length) { return length * length; } /// <summary> /// 获取两个string字符串的匹配度 /// </summary> /// <param name="list1"></param> /// <param name="list2"></param> /// <returns></returns> public virtual int GetMatchScoreOfLCS( char [] list1, char [] list2) { int [,] lcs; //最大匹配度 BackTracking[,] backTracer; //需要执行的操作 int score = GetMatchScoreOfLCS(list1, list2, out lcs, out backTracer); //最终匹配度 return score; } /// <summary> /// 计算匹配度 /// </summary> /// <param name="list1"></param> /// <param name="list2"></param> /// <param name="lcs"></param> /// <param name="backTracer"></param> /// <returns></returns> protected int GetMatchScoreOfLCS( char [] list1, char [] list2, out int [,] lcs, out BackTracking[,] backTracer) { int m = list1.Length; int n = list2.Length; lcs = new int [m, n]; //最大匹配度 backTracer = new BackTracking[m, n]; //需要执行的操作 int [,] w = new int [m, n]; //连续匹配的长度 int i, j; #region 初始化lcs、backTracer for (i = 0; i < m; ++i) { lcs[i, 0] = 0; backTracer[i, 0] = BackTracking.UP; } for (j = 0; j < n; ++j) { lcs[0, j] = 0; backTracer[0, j] = BackTracking.LEFT; } #endregion #region 给lcs、backTracer、w赋值 for (i = 0; i < m; i++) { for (j = 0; j < n; j++) { if (list1[i] == list2[j]) { int k = 0; int prev = 0; if (i > 0 && j > 0) { k = w[i - 1, j - 1]; prev = lcs[i - 1, j - 1]; } //eviation unit between k+1 and k instead of 1 in basic LCS lcs[i, j] = prev + ConsecutiveMeasure(k + 1) - ConsecutiveMeasure(k); backTracer[i, j] = BackTracking.UP_AND_LEFT; w[i, j] = k + 1; } if (i > 0 && (lcs[i - 1, j] > lcs[i, j])) { lcs[i, j] = lcs[i - 1, j]; backTracer[i, j] = BackTracking.UP; w[i, j] = 0; } if (j > 0 && (lcs[i, j - 1] > lcs[i, j])) { lcs[i, j] = lcs[i, j - 1]; backTracer[i, j] = BackTracking.LEFT; w[i, j] = 0; } } } #endregion return lcs[m - 1, n - 1]; //最终匹配度 } } public class LCSMatchForString : LCSBaseMatch { /// <summary> /// get The Longest Common Substring /// </summary> /// <param name="list1"></param> /// <param name="list2"></param> /// <returns></returns> public string LCS( string s1, string s2) { char [] list1 = s1.ToArray(); char [] list2 = s2.ToArray(); int m = list1.Length; int n = list2.Length; int [,] lcs ; //最大匹配度 BackTracking[,] backTracer ; //需要执行的操作 int score = GetMatchScoreOfLCS(list1,list2, out lcs, out backTracer); //最终匹配度 #region 获取最大匹配的字符串 int i = m - 1; int j = n - 1; string subseq = "" ; //trace the backtracking matrix. while (i >=0 && j >=0) { if (backTracer[i, j] == BackTracking.NEITHER) break ; if (backTracer[i, j] == BackTracking.UP_AND_LEFT) { subseq = list1[i]+ subseq; i--; j--; } else if (backTracer[i, j] == BackTracking.UP) { i--; } else if (backTracer[i, j] == BackTracking.LEFT) { j--; } } #endregion return subseq; } } |
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 没有源码,如何修改代码逻辑?
· 一个奇形怪状的面试题:Bean中的CHM要不要加volatile?
· [.NET]调用本地 Deepseek 模型
· 一个费力不讨好的项目,让我损失了近一半的绩效!
· .NET Core 托管堆内存泄露/CPU异常的常见思路
· 微软正式发布.NET 10 Preview 1:开启下一代开发框架新篇章
· DeepSeek R1 简明指南:架构、训练、本地部署及硬件要求
· 没有源码,如何修改代码逻辑?
· NetPad:一个.NET开源、跨平台的C#编辑器
· 面试官:你是如何进行SQL调优的?