Commit ecaf278

committed

Add C++ implementation

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

1 parent 84dd3f8 commit ecaf278Copy full SHA for ecaf278

File tree

+66

-0

lines changed

+66

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,6 @@`
`1`	`1`	`#include <stdio.h>`
`2`	`2`	`#include <stdlib.h>`
	`3`	`+#include <string.h>`
`3`	`4`
`4`	`5`
`5`	`6`	`static inline int max(int a, int b)`

Lines changed: 2 additions & 0 deletions

Lines changed: 39 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,39 @@`
	`1`	`+#include <stdio.h>`
	`2`	`+#include <stdlib.h>`
	`3`	`+#include <string.h>`
	`4`	`+`
	`5`	`+`
	`6`	`+static inline int min(int a, int b)`
	`7`	`+{`
	`8`	`+ return a < b ? a : b;`
	`9`	`+}`
	`10`	`+`
	`11`	`+int minInsertions(char * s){`
	`12`	`+ int i, j, len = strlen(s);`
	`13`	`+ int dp = malloc(len sizeof(int));`
	`14`	`+ memset(dp, 0, len * sizeof(int));`
	`15`	`+ for (i = len - 2; i >= 0; i--) {`
	`16`	`+ int left_down = 0;`
	`17`	`+ for (j = i + 1; j < len; j++) {`
	`18`	`+ int down = dp[j];`
	`19`	`+ if (s[i] == s[j]) {`
	`20`	`+ dp[j] = left_down;`
	`21`	`+ } else {`
	`22`	`+ dp[j] = min(down, dp[j - 1]) + 1;`
	`23`	`+ }`
	`24`	`+ left_down = down;`
	`25`	`+ }`
	`26`	`+ }`
	`27`	`+ return dp[len - 1];`
	`28`	`+}`
	`29`	`+`
	`30`	`+int main(int argc, char **argv)`
	`31`	`+{`
	`32`	`+ if (argc != 2) {`
	`33`	`+ fprintf(stderr, "Usage: ./test s\n");`
	`34`	`+ exit(-1);`
	`35`	`+ }`
	`36`	`+`
	`37`	`+ printf("%d\n", minInsertions(argv[1]));`
	`38`	`+ return 0;`
	`39`	`+}`

Lines changed: 24 additions & 0 deletions

Comments

(0)