Commit 44474a1

authored

add cleaner solution

1 parent a25fff3 commit 44474a1Copy full SHA for 44474a1

File tree

+24

-0

lines changed

+24

-0

lines changed

Lines changed: 24 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -13,4 +13,28 @@ def minDistance(self, word1, word2):`
`13`	`13`	`dp[i][j] = min(dp[i-1][j]+1, dp[i][j-1]+1, dp[i-1][j-1]+(word1[i-1]!=word2[j-1]))`
`14`	`14`	`return dp[-1][-1]`
`15`	`15`
	`16`	`+#sample 282 ms submission`
	`17`	`+class Solution(object):`
	`18`	`+ def minDistance(self, word1, word2):`
	`19`	`+ """`
	`20`	`+ :type word1: str`
	`21`	`+ :type word2: str`
	`22`	`+ :rtype: int`
	`23`	`+ """`
	`24`	`+ m = len(word1)`
	`25`	`+ n = len(word2)`
	`26`	`+ dp = [[0 for x in xrange(n+1)] for x in xrange(m+1)]`
	`27`	`+`
	`28`	`+ for i in xrange(m+1):`
	`29`	`+ for j in xrange(n+1):`
	`30`	`+ if i == 0:`
	`31`	`+ dp[i][j] = j`
	`32`	`+ elif j == 0:`
	`33`	`+ dp[i][j] = i`
	`34`	`+ elif word1[i-1] == word2[j-1]:`
	`35`	`+ dp[i][j] = dp[i-1][j-1]`
	`36`	`+ else:`
	`37`	`+ dp[i][j] = 1 + min(dp[i-1][j], dp[i][j-1], dp[i-1][j-1])`
	`38`	`+`
	`39`	`+ return dp[m][n]`
`16`	`40`

Comments

(0)