mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-02-04 02:56:40 +08:00
0d766b0f8a
* chore: add cache and build comment to git ignore
* fix: add cmakelists to dynamic programming
* fix: add cmakelists to greedy_algorithms
* fix: add cmakelists to operations_on_datastructures
* fix: add cmakelists to range_queries
* fix: add `dynamic_programmin`, `greedy_algorithms`, `range_queries` and `operations_on_datastructures` subdirectories to cmakelists.txt
* fix: init of transform_reduce in dynamic_programming
* fix: add an include for functional in catalan_numbers
* chore: bump CXX standard to 20
* revert: bump CXX standard to 20
* chore: bump c++ version to 17 and add justification
Arm supports c++ 17
Esp32 supports c++ 23
decision was made to be 17 because it seemed to offer the best combatability
* fix: compilation error in catalan numbers
* fix: add <set> header to longest increasing subsequence nlogn
* fix: add cmath & algorithm header to mo.cpp
* fix: remove register key word from fast integer
* fix: replace using namespace std with std::cin and std::cout
* docs: typo in c++17
* fix: memory leak in bellman_ford
* fix: typo in bellman_ford
* fix: typo in word_break
* fix: dynamic array in coin_change
* fix dynamic array in egg_dropping puzzle
* chore: remove unnecessary comment
* fix: add vla to be an error
* chore: add extra warnings
* fix: use add_compile options instead of set()
* fix: compile options are not strings
* fix: vla in floyd_warshall
* fix: vla in egg_dropping_puzzel
* fix: vla in coin_change
* fix: vla in edit_distance
* fix: vla in floyd_warshall
* feat: remove kadane and replace it with kadane2
* fix: vla in longest_common_subsequence
* fix: int overflow in floyd_warshall
* fix: vla in lisnlogn
* fix: use const vector& instead of array
* fix: use dynamic array instead of vla in knapsack
* fix: use of and in msvc is unsupported by default adding permissive flag fixes it
* test: make executables the tests themselves
* Revert "test: make executables the tests themselves"
This reverts commit 7a16c31c4e.
* fix: make dist constant in print
* fix: namespace issue in unbounded_0_1
* fix: include cstdint to fix compilation
87 lines
2.3 KiB
C++
87 lines
2.3 KiB
C++
/* Given two strings str1 & str2
|
|
* and below operations that can
|
|
* be performed on str1. Find
|
|
* minimum number of edits
|
|
* (operations) required to convert
|
|
* 'str1' into 'str2'/
|
|
* a. Insert
|
|
* b. Remove
|
|
* c. Replace
|
|
* All of the above operations are
|
|
* of equal cost
|
|
*/
|
|
|
|
#include <iostream>
|
|
#include <string>
|
|
#include <vector>
|
|
using namespace std;
|
|
|
|
int min(int x, int y, int z) { return min(min(x, y), z); }
|
|
|
|
/* A Naive recursive C++ program to find
|
|
* minimum number of operations to convert
|
|
* str1 to str2.
|
|
* O(3^m)
|
|
*/
|
|
int editDist(string str1, string str2, int m, int n) {
|
|
if (m == 0)
|
|
return n;
|
|
if (n == 0)
|
|
return m;
|
|
|
|
// If last characters are same then continue
|
|
// for the rest of them.
|
|
if (str1[m - 1] == str2[n - 1])
|
|
return editDist(str1, str2, m - 1, n - 1);
|
|
|
|
// If last not same, then 3 possibilities
|
|
// a.Insert b.Remove c. Replace
|
|
// Get min of three and continue for rest.
|
|
return 1 + min(editDist(str1, str2, m, n - 1),
|
|
editDist(str1, str2, m - 1, n),
|
|
editDist(str1, str2, m - 1, n - 1));
|
|
}
|
|
|
|
/* A DP based program
|
|
* O(m x n)
|
|
*/
|
|
int editDistDP(string str1, string str2, int m, int n) {
|
|
// Create Table for SubProblems
|
|
std::vector<std::vector<int> > dp(m + 1, std::vector<int>(n + 1));
|
|
|
|
// Fill d[][] in bottom up manner
|
|
for (int i = 0; i <= m; i++) {
|
|
for (int j = 0; j <= n; j++) {
|
|
// If str1 empty. Then add all of str2
|
|
if (i == 0)
|
|
dp[i][j] = j;
|
|
|
|
// If str2 empty. Then add all of str1
|
|
else if (j == 0)
|
|
dp[i][j] = i;
|
|
|
|
// If character same. Recur for remaining
|
|
else if (str1[i - 1] == str2[j - 1])
|
|
dp[i][j] = dp[i - 1][j - 1];
|
|
|
|
else
|
|
dp[i][j] = 1 + min(dp[i][j - 1], // Insert
|
|
dp[i - 1][j], // Remove
|
|
dp[i - 1][j - 1] // Replace
|
|
);
|
|
}
|
|
}
|
|
|
|
return dp[m][n];
|
|
}
|
|
|
|
int main() {
|
|
string str1 = "sunday";
|
|
string str2 = "saturday";
|
|
|
|
cout << editDist(str1, str2, str1.length(), str2.length()) << endl;
|
|
cout << editDistDP(str1, str2, str1.length(), str2.length()) << endl;
|
|
|
|
return 0;
|
|
}
|