Given an unlimited number of coins, the value of 25 points, 10 points, 5 points and 1 points, write code calculation n there are several representations

Source: Internet
Author: User

Solution:

This is a recursive problem, and we want to figure out how to use the earlier answer (the answer to the sub-question) to calculate the Makechange (n).


public int makechange (int n,int denom)
{
int next_denom=0;
Switch (denom)
{
Case 25:
next_denom=10;
Break
Case 10:
next_denom=5;
Break
Case 5:
Next_denom=1;
Break
Case 1:
return 1;
}
int ways=0;
for (int i=0;i*denom<=n;i++)
Ways+=makechange (N-i*denom,next_denom);
return ways;
}

System.out.writeln (Makechange (100,25));


Copyright NOTICE: This article for Bo Master original article, without Bo Master permission not reproduced.

Given an unlimited number of coins, the value of 25 points, 10 points, 5 points and 1 points, write code calculation n there are several representations

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.