这个算法是基于动态规划（DP）的思想，解决了发音长短不一的模板匹配问题，简单来说，就是通过构建一个邻接矩阵，寻找最短路径和。-This algorithm is based on the idea of ​ ​ dynamic programming (DP) to solve the problem of template matching pronunciation of varying lengths, in simple terms, is by building a

WireRourting布线程序 给定一个矩阵，里面有1和0,0代表可通过，1代表不可通过，给定一个start position，要求找到target position的最短路径-WireRourting A common approach to the wire routing problem for electrical circuits is to impose a grid over the wire routing region. The grid divides the