Leetcode 72. 编辑距离（DAY 57） ---- 动态规划学习期（一个寒假住寝室电费377 什么水平爹怒了）（含题解）-CSDN博客

本文链接：https://blog.csdn.net/qq_37500516/article/details/114254176

文章目录

原题题目

在这里插入图片描述

代码实现（含题解注释首刷大部分看解）

int minDistance(char * word1, char * word2){
    int strl1 = strlen(word1),strl2 = strlen(word2),i,j;
    int dp[strl1+1][strl2+1];
    memset(dp,0,sizeof(dp));
    for(i=0;i<=strl2;i++)
        dp[0][i] = i; //word2全添加
    for(i=0;i<=strl1;i++)
        dp[i][0] = i; //word1全删除
    for(i=1;i<=strl1;i++)
    {
        for(j=1;j<=strl2;j++)
        { //dp[i-1][j]+1为删除 dp[i-1][j-1]+1为修改 dp[i][j-1]为增加
            if(word1[i-1] != word2[j-1])
                dp[i][j] = fmin(dp[i-1][j]+1,fmin(dp[i-1][j-1]+1,dp[i][j-1]+1));
            else
                dp[i][j] = dp[i-1][j-1];
        }
    }
    return dp[strl1][strl2];
}

代码实现（二刷DAY 99 看了部分一解的思路刚开始还是无思路）

class Solution {
public:
    int minDistance(string word1, string word2) {
        int w1size = word1.size(),w2size = word2.size();
        vector<vector<int>> dp(w1size+1,vector<int>(w2size+1,0));

        for(int i=1;i<=w1size;++i)  dp[i][0] = i;
        for(int i=1;i<=w2size;++i)  dp[0][i] = i;

        for(int i=1;i<=w1size;++i)
        {
            for(int j=1;j<=w2size;++j)
            {
                if(word1[i-1] == word2[j-1])    dp[i][j] = dp[i-1][j-1];
                else    dp[i][j] = min(dp[i][j-1],min(dp[i-1][j],dp[i-1][j-1]))+1;
            }
        }
        return dp[w1size][w2size];
    }       
};

代码实现（三刷自解 DAY 231 C++）

class Solution {
public:
    int minDistance(string word1, string word2) {
        vector<vector<int>> dp(word1.size()+1,vector<int>(word2.size()+1,0));
        int sz1 = word1.size(),sz2 = word2.size();

        for(int i = 0;i <= sz1;++i)
            dp[i][0] = i;
        for(int i = 0;i <= sz2;++i)
            dp[0][i] = i;

        for(int i = 1;i <= sz1;++i)
            for(int j = 1;j <= sz2;++j)
                dp[i][j] = min(dp[i-1][j] + 1,min(dp[i][j-1] + 1,dp[i-1][j-1] + (word1[i-1] != word2[j-1])));
        return dp[sz1][sz2];
    }
};

代码实现（四刷自解 DAY 278 C++）

class Solution {
public:
    int minDistance(string word1, string word2) {
      int size1 = word1.size(), size2 = word2.size(); 
      vector<vector<int>> dp(size1 + 1, vector<int>(size2 + 1, INT_MAX));

      for (int i = 0; i <= size2; ++i) {
        dp[0][i] = i;
      }

      for (int i = 0; i <= size1; ++i) {
        dp[i][0] = i;
      }

      for (int i = 1; i <= size1; ++i) {
        for (int j = 1; j <= size2; ++j) {
          if (word1[i - 1] != word2[j - 1]) {
            dp[i][j] = min(dp[i][j], dp[i - 1][j] + 1);
            dp[i][j] = min(dp[i][j], dp[i][j - 1] + 1);
            dp[i][j] = min(dp[i][j], dp[i - 1][j - 1] + 1);
          } else {
            dp[i][j] = dp[i - 1][j - 1];
          }
        }
      }

      return dp[size1][size2];
    }
};

代码实现（五刷自解 DAY 4 Golang）

func min(x, y int) int {
  if x <= y {
    return x
  } else {
    return y
  }
}

func minDistance(word1 string, word2 string) int {
  dp := make([][]int, len(word1) + 1)
  for i, _ := range dp {
    dp[i] = make([]int, len(word2) + 1)
  }

  for i := 1; i <= len(word1); i++ {
    dp[i][0] = i
  }

  for i := 1; i <= len(word2); i++ {
    dp[0][i] = i
  }

  for i := 1; i <= len(word1); i++ {
    for j := 1; j <= len(word2); j++ {
      if word1[i - 1] == word2[j - 1] {
        dp[i][j] = dp[i - 1][j - 1]
      } else {
        dp[i][j] = dp[i - 1][j - 1] + 1
        dp[i][j] = min(dp[i][j], min(dp[i - 1][j] + 1, dp[i][j - 1] + 1))
      }
    }
  }  
  return dp[len(dp) - 1][len(dp[0]) - 1]
}