Coin Change II

You are given an integer array coins, where each value represents a coin denomination, and an integer amount, which is the total amount of money you want to form.

Return the number of different combinations that add up to amount. If no combination can form the total, return 0.

You have an unlimited supply of each coin denomination. The answer fits in a signed 32-bit integer.

Examples
Input: [5,[1,2,5]]
Output: 4
Hints

Coin Change II

You are given an integer array `coins`, where each value represents a coin denomination, and an integer `amount`, which is the total amount of money you want to form.