From 17fa8fbdd9eafdc2b4e061d013aa1ae080e00b35 Mon Sep 17 00:00:00 2001 From: Snigdha Sharma <46266633+Snigdha-Sharma@users.noreply.github.com> Date: Thu, 20 Oct 2022 19:20:36 +0530 Subject: [PATCH 1/2] Add files via upload Problem 72 of Leetcode. Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2. Logic is explained in code comments. --- C++/EditDistance.cpp | 46 ++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 46 insertions(+) create mode 100644 C++/EditDistance.cpp diff --git a/C++/EditDistance.cpp b/C++/EditDistance.cpp new file mode 100644 index 0000000..5877773 --- /dev/null +++ b/C++/EditDistance.cpp @@ -0,0 +1,46 @@ +class Solution +{ + public: + int minDistance(string word1, string word2) + { + //replace | delete + //insert | + int N=word1.size(),M=word2.size(); + //This is a dp problem. Maintain a matrix where characters of the word you want to convert to are on the top and the word which is being converted is on the left. + //Now whenever you are getting the cell value from diagonal and the value of the diagonal cell is same it means that the character was same in both strings. + //If it was different then this means you replaced the character with correct one. + //If the value you took was from the left cell that means you added that character from the column. + vector > dp(N+1,vector (M+1,0)); + for (int i=0;i<=N;i++) + { + dp[i][0]=i; + } + for (int i=0;i<=M;i++) + { + dp[0][i]=i; + } + for (int i=1;i<=N;i++) + { + for (int j=1;j<=M;j++) + { + if (word1[i-1]==word2[j-1]) + { + dp[i][j]=dp[i-1][j-1]; + } + else + { + dp[i][j]=min(dp[i-1][j],min(dp[i][j-1],dp[i-1][j-1]))+1; + } + } + } + // for (int i=0;i<=N;i++) + // { + // for (int j=0;j<=M;j++) + // { + // cout< Date: Thu, 20 Oct 2022 19:22:55 +0530 Subject: [PATCH 2/2] Update Contributors.md --- Contributors.md | 3 +++ 1 file changed, 3 insertions(+) diff --git a/Contributors.md b/Contributors.md index efcf8ce..428dacf 100644 --- a/Contributors.md +++ b/Contributors.md @@ -29,3 +29,6 @@ **Caitlin Genna** --> "CS Computer Science Graduate, Fordham University." --> [caitlingenna](https://github.com/caitlingenna) +**Snigdha Sharma** --> "B. Tech, CSE from MNNIT Allahabad" --> [Snigdha-Sharma](https://github.com/Snigdha-Sharma) + +