Coin change problem --why not??

Правка en2, от mkmeden, 2022-07-13 21:34:07

In the standard coin exchange problem were each denominations are available infinite times and we need to find the number of ways in which we can form the target value :

for a recursive function int fun(int n , int val) and the arr contains the denominations.

this is how the possible cases for the recursive calls should be .

Spoiler

But before seeing the solution I thought it like this instead ( definitely wrong )

Spoiler

I considered one more case too were we take the coin and move to the next index and I cant find a reasoning why this is wrong logically .

Might be a stupid doubt but cant get over it just like that. Can anyone tell me why is it wrong to consider that case.

Thanks

Теги dynamic programming

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский mkmeden 2022-07-13 21:36:53 26
en3 Английский mkmeden 2022-07-13 21:35:10 6
en2 Английский mkmeden 2022-07-13 21:34:07 221
en1 Английский mkmeden 2022-07-13 21:32:29 895 Initial revision (published)