企业官网建设流程全解析

题目法1DP基本方法必须掌握DP算法的具体含义可以参考《算法小抄》第148页。PythonclassSolution:defminInsertions(self,s:str)-int:nlen(s)dp[[0]*nfor_inrange(n)]foriinrange(n-1,-1,-1):forjinrange(i1,n):ifs[i]s[j]:dp[i][j]0ifj-i0elsedp[i1][j-1]else:dp[i][j]min(dp[i1][j],dp[i][j-1])1returndp[0][n-1]JavaclassSolution{publicintminInsertions(Strings){intns.length();if(n2){return0;}int[][]dpnewint[n][n];// 对于字符串s[i:j], 至少需要dp[i][j]次操作构成回文串for(intin-2;i0;--i){for(intji1;jn;j){if(s.charAt(i)s.charAt(j)){dp[i][j]dp[i1][j-1];}else{dp[i][j]Math.min(dp[i1][j],dp[i][j-1])1;}}}returndp[0][n-1];}}