Commit 587cc5c

committed

Improvement

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

1 parent 6de6ce5 commit 587cc5cCopy full SHA for 587cc5c

File tree

+49

-16

lines changed

+49

-16

lines changed

Lines changed: 14 additions & 11 deletions

Original file line number	Diff line number	Diff line change
`@@ -31,31 +31,34 @@ static inline int min(int a, int b)`
`31`	`31`	`static int minDistance(char* word1, char* word2)`
`32`	`32`	`{`
`33`	`33`	`int i, j;`
`34`		`- int len1 = strlen(word1);`
`35`		`- int len2 = strlen(word2);`
`36`		`- int table = malloc((len1 + 1) (len2 + 1) * sizeof(int));`
`37`		`- int *dp = malloc((len1 + 1) sizeof(int *));`
`38`		`- for (i = 0; i < len1 + 1; i++) {`
`39`		`- dp[i] = table + i * (len2 + 1);`
	`34`	`+ int l1 = strlen(word1);`
	`35`	`+ int l2 = strlen(word2);`
	`36`	`+ int table = malloc((l1 + 1) (l2 + 1) * sizeof(int));`
	`37`	`+ int *dp = malloc((l1 + 1) sizeof(int *));`
	`38`	`+`
	`39`	`+ for (i = 0; i < l1 + 1; i++) {`
	`40`	`+ dp[i] = table + i * (l2 + 1);`
`40`	`41`	`}`
`41`	`42`
`42`		`- for (i = 0; i < len2 + 1; i++) {`
	`43`	`+ dp[0][0] = 0;`
	`44`	`+ for (i = 1; i <= l2; i++) {`
`43`	`45`	`dp[0][i] = i;`
`44`	`46`	`}`
`45`		`- for (i = 0; i <len1+1; i++) {`
	`47`	`+ for (i = 1; i <= l1; i++) {`
`46`	`48`	`dp[i][0] = i;`
`47`	`49`	`}`
`48`	`50`
`49`		`- for (i = 1; i <len1+1; i++) {`
`50`		`- for (j = 1; j <len2+1; j++) {`
	`51`	`+ for (i = 1; i <= l1; i++) {`
	`52`	`+ for (j = 1; j <= l2; j++) {`
`51`	`53`	`if (word1[i - 1] == word2[j - 1]) {`
`52`	`54`	`dp[i][j] = dp[i - 1][j - 1];`
`53`	`55`	`} else {`
`54`	`56`	`dp[i][j] = 1 + min(dp[i - 1][j - 1], min(dp[i - 1][j], dp[i][j - 1]));`
`55`	`57`	`}`
`56`	`58`	`}`
`57`	`59`	`}`
`58`		`- return dp[len1][len2];`
	`60`	`+`
	`61`	`+ return dp[l1][l2];`
`59`	`62`	`}`
`60`	`63`
`61`	`64`	`int main(int argc, char **argv)`

Lines changed: 1 addition & 0 deletions

Lines changed: 29 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -2,6 +2,11 @@`
`2`	`2`	`#include <stdlib.h>`
`3`	`3`
`4`	`4`
	`5`	`+static int max(int a, int b)`
	`6`	`+{`
	`7`	`+ return a > b ? a : b;`
	`8`	`+}`
	`9`	`+`
`5`	`10`	`static int binary_search(int *nums, int lo, int hi, int target)`
`6`	`11`	`{`
`7`	`12`	`while (lo + 1 < hi) {`
`@@ -15,7 +20,9 @@ static int binary_search(int *nums, int lo, int hi, int target)`
`15`	`20`	`return hi;`
`16`	`21`	`}`
`17`	`22`
`18`		`-int lengthOfLIS(int* nums, int numsSize){`
	`23`	`+int lengthOfLIS(int* nums, int numsSize)`
	`24`	`+{`
	`25`	`+#if 0`
`19`	`26`	`int i, piles = 0;`
`20`	`27`	`int tops = malloc(numsSize sizeof(int));`
`21`	`28`	`for (i = 0; i < numsSize; i++) {`
`@@ -26,6 +33,27 @@ int lengthOfLIS(int* nums, int numsSize){`
`26`	`33`	`tops[pos] = nums[i];`
`27`	`34`	`}`
`28`	`35`	`return piles;`
	`36`	`+#else`
	`37`	`+ int i, j, res = 0;`
	`38`	`+ int dp = malloc(numsSize sizeof(int));`
	`39`	`+`
	`40`	`+ /* dp array records subsequence length of nums[0...i], so we need to`
	`41`	`+ * initialize each dp[i] with one element length in the beginning. */`
	`42`	`+ for (i = 0; i < numsSize; i++) {`
	`43`	`+ dp[i] = 1;`
	`44`	`+ for (j = 0; j < i; j++) {`
	`45`	`+ if (nums[j] > nums[i]) {`
	`46`	`+ dp[i] = max(dp[i], dp[j] + 1);`
	`47`	`+ }`
	`48`	`+ }`
	`49`	`+ }`
	`50`	`+`
	`51`	`+ for (i = 0; i < numsSize; i++) {`
	`52`	`+ res = max(res, dp[i]);`
	`53`	`+ }`
	`54`	`+`
	`55`	`+ return res;`
	`56`	`+#endif`
`29`	`57`	`}`
`30`	`58`
`31`	`59`	`int main(int argc, char **argv)`

Lines changed: 5 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,13 +6,14 @@ int coinChange(int* coins, int coinsSize, int amount)`
`6`	`6`	`{`
`7`	`7`	`int i, j;`
`8`	`8`	`int dp = malloc((amount + 1) sizeof(int));`
`9`		`- for (i = 1; i <= amount; i++) {`
`10`		`- /* INT_MAX */`
`11`		`- dp[i] = amount + 1;`
`12`		`- }`
`13`	`9`
	`10`	`+ /* The dp array records minimum coin number corresponding to the`
	`11`	`+ * amount of coins. So we need to initialize each dp[i] with`
	`12`	`+ * amount + 1 as an invalid value */`
`14`	`13`	`dp[0] = 0;`
`15`	`14`	`for (i = 1; i <= amount; i++) {`
	`15`	`+ /* initialized with INT_MAX */`
	`16`	`+ dp[i] = amount + 1;`
`16`	`17`	`for (j = 0; j < coinsSize; j++) {`
`17`	`18`	`if (i - coins[j] >= 0) {`
`18`	`19`	`int tmp = 1 + dp[i - coins[j]];`

Comments

(0)