更新代码块

problems/0072.编辑距离.md

@@ -123,7 +123,7 @@ if (word1[i - 1] != word2[j - 1])
 
 递归公式代码如下：
 
-```C++
+```CPP
 if (word1[i - 1] == word2[j - 1]) {
     dp[i][j] = dp[i - 1][j - 1];
 }
@@ -151,7 +151,7 @@ dp[i][0] ：以下标i-1为结尾的字符串word1，和空字符串word2，最
 
 所以C++代码如下：
 
-```C++
+```CPP
 for (int i = 0; i <= word1.size(); i++) dp[i][0] = i;
 for (int j = 0; j <= word2.size(); j++) dp[0][j] = j;
 ```
@@ -175,7 +175,7 @@ for (int j = 0; j <= word2.size(); j++) dp[0][j] = j;
 
 代码如下：
 
-```C++
+```CPP
 for (int i = 1; i <= word1.size(); i++) {
     for (int j = 1; j <= word2.size(); j++) {
         if (word1[i - 1] == word2[j - 1]) {
@@ -198,7 +198,7 @@ for (int i = 1; i <= word1.size(); i++) {
 
 以上动规五部分析完毕，C++代码如下：
 
-```C++
+```CPP
 class Solution {
 public:
     int minDistance(string word1, string word2) {