K-approximate matching, dynamic programming method. Two input text and edit distance k, find k within the text to match. The code is a short, not quite algorithms foundation is difficult to understand. The best reference to the classic algorithm design books.

K-近似匹配
..........\bin
..........\...\Debug
..........\...\.....\ConsoleApplication5.exe
..........\...\.....\ConsoleApplication5.pdb
..........\...\.....\ConsoleApplication5.vshost.exe
..........\ConsoleApplication5.csproj
..........\ConsoleApplication5.sln
..........\ConsoleApplication5.suo
..........\obj
..........\...\ConsoleApplication5.csproj.FileList.txt
..........\...\Debug
..........\...\.....\ConsoleApplication5.exe
..........\...\.....\ConsoleApplication5.pdb
..........\...\.....\TempPE
..........\Program.cs
..........\Properties
..........\..........\AssemblyInfo.cs

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．