摘要: //动态规划 public boolean match(char[] str, char[] pattern){ //a.*vc* int sLen=str.length,pLen=pattern.length; boolean[][] dp=new boolean[sLen+1][pLen+1]; 阅读全文
posted @ 2020-07-08 08:15 程序杰杰 阅读(156) 评论(0) 推荐(0) 编辑