Leetcode summary: dynamic programing, [322] coin change & [474] ones and zeros

[322] coin change

You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1.

Example 1:

Input: coins = [1, 2, 5], amount = 11
Output: 3
Explanation: 11 = 5 + 5 + 1
Example 2:

Input: coins = [2], amount = 3
Output: -1

class Solution(object):
    def coinChange(self, coins, amount):
        """
        :type coins: List[int]
        :type amount: int
        :rtype: int
        """
        #init as amount+1, cause '1' maybe not in coins, so amount is max, and will
        #check at the end, if still amount+1, then return -1,no solution
        dp=[amount+1 for i in range(amount+1)]
        dp[0]=0
        
        for i in range(1,amount+1):
            for coin in coins:
                if coin<=amount:
                    dp[i]=min(dp[i],dp[i-coin]+1)
                    
        if dp[-1]>amount:
            return -1
        else:
            return dp[-1]

[474] ones and zeros

class Solution(object):
    def findMaxForm(self, strs, m, n):
        """
        :type strs: List[str]
        :type m: int
        :type n: int
        :rtype: int
        """
        dp=[[0 for i in range(n+1)] for j in range(m+1)]

        for s in strs:
            z=0
            o=0
            for c in s:
                if c=='0':
                    z+=1
                else:
                    o+=1
                   
            for i in range(m,z-1,-1):
                for j in range(n,o-1,-1):
                    dp[i][j]=max(dp[i][j],dp[i-z][j-o]+1)

        return dp[m][n]