How to optimize a coin change problem in java

Question

so my program already solves a coin change problem, which asks to find the ways (and show them) in which you can pay from a given array of coins to the exact given target am