Commit 769617d

committed

Add C++ implementation

Signed-off-by: begeekmyfriend <begeekmyfriend@gmail.com>

1 parent 887c77f commit 769617dCopy full SHA for 769617d

File tree

+15

-13

lines changed

+15

-13

lines changed

Lines changed: 15 additions & 13 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,25 +5,27 @@ using namespace std;`
`5`	`5`	`class Solution {`
`6`	`6`	`public:`
`7`	`7`	`int minDistance(string word1, string word2) {`
`8`		`- vector<vector<int>> dp;`
`9`		`- for (int i = 0; i <= word1.length(); i++) {`
`10`		`- dp.push_back(vector<int>(word2.length() + 1));`
`11`		`- dp[i][0] = i;`
`12`		`- }`
`13`		`- for (int i = 0; i <= word2.length(); i++) {`
`14`		`- dp[0][i] = i;`
	`8`	`+ int l1 = word1.length();`
	`9`	`+ int l2 = word2.length();`
	`10`	`+ vector<int> dp(l2 + 1);`
	`11`	`+ for (int i = 0; i <= l2; i++) {`
	`12`	`+ dp[i] = i;`
`15`	`13`	`}`
`16`	`14`
`17`		`- for (int i = 1; i <= word1.length(); i++) {`
`18`		`- for (int j = 1; j <= word2.length(); j++) {`
	`15`	`+ int up = 0;`
	`16`	`+ for (int i = 1; i <= l1; i++) {`
	`17`	`+ int left_up = dp[0];`
	`18`	`+ dp[0] = i;`
	`19`	`+ for (int j = 1; j <= l2; j++) {`
	`20`	`+ up = dp[j];`
`19`	`21`	`if (word1[i - 1] == word2[j - 1]) {`
`20`		`- dp[i][j] = dp[i - 1][j - 1];`
	`22`	`+ dp[j] = left_up;`
`21`	`23`	`} else {`
`22`		`- dp[i][j] = 1 + min(dp[i - 1][j - 1], min(dp[i - 1][j], dp[i][j - 1]));`
	`24`	`+ dp[j] = 1 + min(left_up, min(up, dp[j - 1]));`
`23`	`25`	`}`
	`26`	`+ left_up = up;`
`24`	`27`	`}`
`25`	`28`	`}`
`26`		`-`
`27`		`- return dp[word1.length()][word2.length()];`
	`29`	`+ return dp[l2];`
`28`	`30`	`}`
`29`	`31`	`};`

Comments

(0)