Piggy Bank of Cooooooode

3 solutions-Dynamic Programming & Expand Around Center &Solution 1 Dynamic ProgrammingThe process of compute dp[i][j] is showed as following:0000 011100 01 0211 122200 01 02 0311 12...

There are many solutions for these two problems. For Jump Game I, greedy is the best method, but we can also use DP to solve it.Jump Game ISolution 1 DPThere are two kind of DP solution, bottom-up...

max(sum,tmp+currentnum,currentnum)If currentnum+tmp>tmp and tmp<0(such as tmp=-2,currentnum=4), discard the elements before current element.class Solution(object): def maxSubArray(self, nu...

recursion & dp(Fibonacci Number)Recursion!TLEclass Solution: def climbStairs(self, n): """ :type n: int :rtype: int """ if n == 1: retur...

key point: Unique Paths II fast versionUnique Paths Iclass Solution: def uniquePaths(self, m, n): """ :type m: int :type n: int :rtype: int """ dp...

class Solution: def minPathSum(self, grid): """ :type grid: List[List[int]] :rtype: int """ m=len(grid) n=len(grid[0]) for i in range(m): ...