A quite similar problem with Coin Change. The difference is the dp usage.

Description

Given an array of distinct integers nums and a target integer target, return the number of possible combinations that add up to target.