Monday, May 4, 2020

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
Solution:

-

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

Check If It Is a Straight Line

You are given an array  coordinates ,  coordinates[i] = [x, y] , where  [x, y]  represents the coordinate of a point. Check if these points ...

  • Leftmost Column with at Least a One
    A binary matrix means that all elements are  0  or  1 . For each  individual  row of the matrix, this row is sorted in non-decreasing order....
  • Cousins in Binary Tree
    In a binary tree, the root node is at depth  0 , and children of each depth  k  node are at depth  k+1 . Two nodes of a binary tree are  cou...
  • Check If It Is a Straight Line
    You are given an array  coordinates ,  coordinates[i] = [x, y] , where  [x, y]  represents the coordinate of a point. Check if these points ...