backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-05-03 08:23:46 +08:00
Code Issues Projects Releases Wiki Activity

Documentation for c26eea874d

Browse Source
This commit is contained in:
realstealthninja
2025-05-19 11:38:33 +00:00
parent c7a9a42397
commit 14583a2f33
2829 changed files with 30266 additions and 21669 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
d9/d31/coin__change__topdown_8cpp.html
View File

@@ -4,7 +4,7 @@
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.12.0"/>
<meta name="generator" content="Doxygen 1.13.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: dynamic_programming/coin_change_topdown.cpp File Reference</title>
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
@@ -60,7 +60,7 @@ window.MathJax = {
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.12.0 -->
<!-- Generated by Doxygen 1.13.2 -->
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:d3d9a9a6595521f9666a5e94cc830dab83b65699&amp;dn=expat.txt MIT */
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
@@ -153,7 +153,7 @@ Namespaces</h2></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:ac816a4ae8a29c156b90377041000929a" id="r_ac816a4ae8a29c156b90377041000929a"><td class="memTemplParams" colspan="2">template&lt;typename T &gt; </td></tr>
<tr class="memitem:ac816a4ae8a29c156b90377041000929a" id="r_ac816a4ae8a29c156b90377041000929a"><td class="memTemplParams" colspan="2">template&lt;typename T&gt; </td></tr>
<tr class="memitem:ac816a4ae8a29c156b90377041000929a"><td class="memTemplItemLeft" align="right" valign="top">int64_t&#160;</td><td class="memTemplItemRight" valign="bottom"><a class="el" href="#ac816a4ae8a29c156b90377041000929a">dynamic_programming::mincoins_topdown::mincoins</a> (const T &amp;n, const std::vector&lt; T &gt; &amp;coins, const int16_t &amp;t, std::vector&lt; T &gt; dp)</td></tr>
<tr class="memdesc:ac816a4ae8a29c156b90377041000929a"><td class="mdescLeft">&#160;</td><td class="mdescRight">This implementation is for finding minimum number of coins . <br /></td></tr>
<tr class="separator:ac816a4ae8a29c156b90377041000929a"><td class="memSeparator" colspan="2">&#160;</td></tr>
@@ -207,7 +207,7 @@ Functions</h2></td></tr>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
template&lt;typename T&gt; </div>
<table class="memname">
<tr>
<td class="memname">int64_t dynamic_programming::mincoins_topdown::mincoins </td>
@@ -257,14 +257,13 @@ template&lt;typename T &gt; </div>
<div class="line"><span class="lineno"> 56</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; t; i++) {</div>
<div class="line"><span class="lineno"> 57</span> <span class="keywordflow">if</span> (n - coins[i] &gt;= 0) { <span class="comment">// if after subtracting the current</span></div>
<div class="line"><span class="lineno"> 58</span> <span class="comment">// denomination is it greater than 0 or not</span></div>
<div class="line"><span class="lineno"> 59</span> <span class="keywordtype">int</span> sub = <a class="code hl_function" href="#ac816a4ae8a29c156b90377041000929a">mincoins</a>(n - coins[i], coins, t, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);</div>
<div class="line"><span class="lineno"> 59</span> <span class="keywordtype">int</span> sub = mincoins(n - coins[i], coins, t, <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);</div>
<div class="line"><span class="lineno"> 60</span> ans = std::min(ans, sub + 1);</div>
<div class="line"><span class="lineno"> 61</span> }</div>
<div class="line"><span class="lineno"> 62</span> }</div>
<div class="line"><span class="lineno"> 63</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[n] = ans;</div>
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">return</span> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>[n]; <span class="comment">// returns minimum number of coins</span></div>
<div class="line"><span class="lineno"> 63</span> dp[n] = ans;</div>
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">return</span> dp[n]; <span class="comment">// returns minimum number of coins</span></div>
<div class="line"><span class="lineno"> 65</span>}</div>
<div class="ttc" id="acoin__change__topdown_8cpp_html_ac816a4ae8a29c156b90377041000929a"><div class="ttname"><a href="#ac816a4ae8a29c156b90377041000929a">dynamic_programming::mincoins_topdown::mincoins</a></div><div class="ttdeci">int64_t mincoins(const T &amp;n, const std::vector&lt; T &gt; &amp;coins, const int16_t &amp;t, std::vector&lt; T &gt; dp)</div><div class="ttdoc">This implementation is for finding minimum number of coins .</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d31/coin__change__topdown_8cpp_source.html#l00047">coin_change_topdown.cpp:47</a></div></div>
<div class="ttc" id="anamespacedp_html"><div class="ttname"><a href="../../df/d88/namespacedp.html">dp</a></div><div class="ttdoc">for std::vector</div><div class="ttdef"><b>Definition</b> <a href="../../de/d8c/partition__problem_8cpp_source.html#l00039">partition_problem.cpp:39</a></div></div>
</div><!-- fragment -->
</div>
@@ -287,7 +286,7 @@ template&lt;typename T &gt; </div>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel">static</span></span> </td>
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
@@ -304,10 +303,11 @@ template&lt;typename T &gt; </div>
<div class="line"><span class="lineno"> 79</span> std::vector&lt;int64_t&gt; arr1{1, 7, 10};</div>
<div class="line"><span class="lineno"> 80</span> std::vector&lt;int64_t&gt; dp1(n1 + 1);</div>
<div class="line"><span class="lineno"> 81</span> <a class="code hl_function" href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a>(dp1.begin(), dp1.end(), a1);</div>
<div class="line"><span class="lineno"> 82</span> assert(dynamic_programming::mincoins_topdown::mincoins(n1, arr1, t1, dp1) ==</div>
<div class="line"><span class="lineno"> 82</span> assert(<a class="code hl_function" href="#ac816a4ae8a29c156b90377041000929a">dynamic_programming::mincoins_topdown::mincoins</a>(n1, arr1, t1, dp1) ==</div>
<div class="line"><span class="lineno"> 83</span> 3);</div>
<div class="line"><span class="lineno"> 84</span> std::cout &lt;&lt; <span class="stringliteral">&quot;Passed\n&quot;</span>;</div>
<div class="line"><span class="lineno"> 85</span>}</div>
<div class="ttc" id="acoin__change__topdown_8cpp_html_ac816a4ae8a29c156b90377041000929a"><div class="ttname"><a href="#ac816a4ae8a29c156b90377041000929a">dynamic_programming::mincoins_topdown::mincoins</a></div><div class="ttdeci">int64_t mincoins(const T &amp;n, const std::vector&lt; T &gt; &amp;coins, const int16_t &amp;t, std::vector&lt; T &gt; dp)</div><div class="ttdoc">This implementation is for finding minimum number of coins .</div><div class="ttdef"><b>Definition</b> <a href="../../d9/d31/coin__change__topdown_8cpp_source.html#l00047">coin_change_topdown.cpp:47</a></div></div>
<div class="ttc" id="adecimal__to__roman__numeral_8cpp_html_a88203bd297e8405160c132faa1187780"><div class="ttname"><a href="../../de/d85/decimal__to__roman__numeral_8cpp.html#a88203bd297e8405160c132faa1187780">fill</a></div><div class="ttdeci">std::string fill(char c, int n)</div><div class="ttdef"><b>Definition</b> <a href="../../de/d85/decimal__to__roman__numeral_8cpp_source.html#l00015">decimal_to_roman_numeral.cpp:15</a></div></div>
</div><!-- fragment -->
</div>
@@ -318,7 +318,7 @@ template&lt;typename T &gt; </div>
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a class="el" href="../../d9/d31/coin__change__topdown_8cpp.html">coin_change_topdown.cpp</a></li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.12.0 </li>
<li class="footer">Generated by <a href="https://www.doxygen.org/index.html"><img class="footer" src="../../doxygen.svg" width="104" height="31" alt="doxygen"/></a> 1.13.2 </li>
</ul>
</div>
</body>