mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-03-24 22:02:20 +08:00
Documentation for 8b1eab204b
This commit is contained in:
@@ -1,3 +1,4 @@
|
||||
<!-- HTML header for doxygen 1.12.0-->
|
||||
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
||||
<html xmlns="http://www.w3.org/1999/xhtml" lang="en-US">
|
||||
<head>
|
||||
@@ -5,10 +6,15 @@
|
||||
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
|
||||
<meta name="generator" content="Doxygen 1.12.0"/>
|
||||
<meta name="viewport" content="width=device-width, initial-scale=1"/>
|
||||
<title>Algorithms_in_C++: dynamic_programming/subset_sum_dynamic.cpp File Reference</title>
|
||||
<title>TheAlgorithms/C++: dynamic_programming/subset_sum_dynamic.cpp File Reference</title>
|
||||
<link rel="icon" href="../../favicon.svg" type="image/x-icon" />
|
||||
<link href="../../tabs.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../jquery.js"></script>
|
||||
<script type="text/javascript" src="../../dynsections.js"></script>
|
||||
<script type="text/javascript" src="https://cdn.jsdelivr.net/npm/@xpack-3rd-party/doxygen-awesome-css@2.2.0-1/doxygen-awesome-darkmode-toggle.js"></script>
|
||||
<script type="text/javascript">
|
||||
DoxygenAwesomeDarkModeToggle.init()
|
||||
</script>
|
||||
<script type="text/javascript" src="../../clipboard.js"></script>
|
||||
<link href="../../navtree.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../navtreedata.js"></script>
|
||||
@@ -18,14 +24,24 @@
|
||||
<link href="../../search/search.css" rel="stylesheet" type="text/css"/>
|
||||
<script type="text/javascript" src="../../search/searchdata.js"></script>
|
||||
<script type="text/javascript" src="../../search/search.js"></script>
|
||||
<script type="text/x-mathjax-config">
|
||||
MathJax.Hub.Config({
|
||||
extensions: ["tex2jax.js", "TeX/AMSmath.js", "TeX/AMSsymbols.js"],
|
||||
jax: ["input/TeX","output/HTML-CSS"],
|
||||
});
|
||||
<script type="text/javascript">
|
||||
window.MathJax = {
|
||||
options: {
|
||||
ignoreHtmlClass: 'tex2jax_ignore',
|
||||
processHtmlClass: 'tex2jax_process'
|
||||
},
|
||||
loader: {
|
||||
load: ['[tex]/ams']
|
||||
},
|
||||
tex: {
|
||||
macros: {},
|
||||
packages: ['base','configmacros','ams']
|
||||
}
|
||||
};
|
||||
</script>
|
||||
<script type="text/javascript" async="async" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.7/MathJax.js?config=TeX-MML-AM_CHTML/MathJax.js"></script>
|
||||
<script type="text/javascript" id="MathJax-script" async="async" src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-chtml.js"></script>
|
||||
<link href="../../doxygen.css" rel="stylesheet" type="text/css" />
|
||||
<link href="../../doxygen-awesome.css" rel="stylesheet" type="text/css"/>
|
||||
</head>
|
||||
<body>
|
||||
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
|
||||
@@ -33,10 +49,11 @@ MathJax.Hub.Config({
|
||||
<table cellspacing="0" cellpadding="0">
|
||||
<tbody>
|
||||
<tr id="projectrow">
|
||||
<td id="projectlogo"><img alt="Logo" src="../../project_logo.png"/></td>
|
||||
<td id="projectalign">
|
||||
<div id="projectname">Algorithms_in_C++<span id="projectnumber"> 1.0.0</span>
|
||||
<div id="projectname">TheAlgorithms/C++<span id="projectnumber"> 1.0.0</span>
|
||||
</div>
|
||||
<div id="projectbrief">Set of algorithms implemented in C++.</div>
|
||||
<div id="projectbrief">All the algorithms implemented in C++</div>
|
||||
</td>
|
||||
</tr>
|
||||
</tbody>
|
||||
@@ -122,7 +139,9 @@ Include dependency graph for subset_sum_dynamic.cpp:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../df/d1f/subset__sum__dynamic_8cpp__incl.svg" width="387" height="126"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
</div><table class="memberdecls">
|
||||
</div>
|
||||
<p><a href="../../dc/d67/subset__sum__dynamic_8cpp_source.html">Go to the source code of this file.</a></p>
|
||||
<table class="memberdecls">
|
||||
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="namespaces" name="namespaces"></a>
|
||||
Namespaces</h2></td></tr>
|
||||
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">namespace  </td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
|
||||
@@ -134,9 +153,9 @@ 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:a280fcfb2f6fe49a31c4da572e7032607" id="r_a280fcfb2f6fe49a31c4da572e7032607"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#a280fcfb2f6fe49a31c4da572e7032607">dynamic_programming::subset_sum::subset_sum_recursion</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int > &arr, int targetSum, <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a>< int, bool > > *dp, int index=0)</td></tr>
|
||||
<tr class="memitem:a280fcfb2f6fe49a31c4da572e7032607" id="r_a280fcfb2f6fe49a31c4da572e7032607"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#a280fcfb2f6fe49a31c4da572e7032607">dynamic_programming::subset_sum::subset_sum_recursion</a> (const std::vector< int > &arr, int targetSum, std::vector< std::unordered_map< int, bool > > *dp, int index=0)</td></tr>
|
||||
<tr class="separator:a280fcfb2f6fe49a31c4da572e7032607"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:ac94e6c0dee11278ac0a5491f1b9a4a50" id="r_ac94e6c0dee11278ac0a5491f1b9a4a50"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#ac94e6c0dee11278ac0a5491f1b9a4a50">dynamic_programming::subset_sum::subset_sum_problem</a> (const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int > &arr, const int targetSum)</td></tr>
|
||||
<tr class="memitem:ac94e6c0dee11278ac0a5491f1b9a4a50" id="r_ac94e6c0dee11278ac0a5491f1b9a4a50"><td class="memItemLeft" align="right" valign="top">bool </td><td class="memItemRight" valign="bottom"><a class="el" href="#ac94e6c0dee11278ac0a5491f1b9a4a50">dynamic_programming::subset_sum::subset_sum_problem</a> (const std::vector< int > &arr, const int targetSum)</td></tr>
|
||||
<tr class="separator:ac94e6c0dee11278ac0a5491f1b9a4a50"><td class="memSeparator" colspan="2"> </td></tr>
|
||||
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void </td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
|
||||
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft"> </td><td class="mdescRight">Test Function. <br /></td></tr>
|
||||
@@ -148,6 +167,8 @@ Functions</h2></td></tr>
|
||||
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
|
||||
<div class="textblock"><p>Implements [Sub-set sum problem] (<a href="https://en.wikipedia.org/wiki/Subset_sum_problem">https://en.wikipedia.org/wiki/Subset_sum_problem</a>) algorithm, which tells whether a subset with target sum exists or not. </p>
|
||||
<p>In this problem, we use dynamic programming to find if we can pull out a subset from an array whose sum is equal to a given target sum. The overall time complexity of the problem is O(n * targetSum) where n is the size of the array. For example, array = [1, -10, 2, 31, -6], targetSum = -14. Output: true => We can pick subset [-10, 2, -6] with sum as (-10) + 2 + (-6) = -14. </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/KillerAV" target="_blank">KillerAV</a> </dd></dl>
|
||||
|
||||
<p class="definition">Definition in file <a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp_source.html">subset_sum_dynamic.cpp</a>.</p>
|
||||
</div><h2 class="groupheader">Function Documentation</h2>
|
||||
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
|
||||
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">◆ </a></span>main()</h2>
|
||||
@@ -166,17 +187,14 @@ Functions</h2></td></tr>
|
||||
|
||||
<p>Main function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>0 on exit </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp_source.html#l00120">120</a> of file <a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp_source.html">subset_sum_dynamic.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 120</span> {</div>
|
||||
<div class="line"><span class="lineno"> 121</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// execute the test</span></div>
|
||||
<div class="line"><span class="lineno"> 122</span> <span class="keywordflow">return</span> 0;</div>
|
||||
<div class="line"><span class="lineno"> 123</span>}</div>
|
||||
<div class="ttc" id="asubset__sum__dynamic_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test Function.</div><div class="ttdef"><b>Definition</b> subset_sum_dynamic.cpp:82</div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d67/subset__sum__dynamic_8cpp_ae66f6b31b5ad750f1fe042a706a4e3d4_cgraph.svg" width="152" height="36"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
<div class="ttc" id="asubset__sum__dynamic_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Test Function.</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d67/subset__sum__dynamic_8cpp_source.html#l00082">subset_sum_dynamic.cpp:82</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="ac94e6c0dee11278ac0a5491f1b9a4a50" name="ac94e6c0dee11278ac0a5491f1b9a4a50"></a>
|
||||
@@ -188,7 +206,7 @@ Here is the call graph for this function:</div>
|
||||
<tr>
|
||||
<td class="memname">bool dynamic_programming::subset_sum::subset_sum_problem </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int > &</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
|
||||
<td class="paramtype">const std::vector< int > &</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
@@ -205,21 +223,16 @@ Here is the call graph for this function:</div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>true/false based on if the target sum subset exists or not. </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp_source.html#l00070">70</a> of file <a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp_source.html">subset_sum_dynamic.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 70</span> {</div>
|
||||
<div class="line"><span class="lineno"> 71</span> <span class="keywordtype">size_t</span> n = arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>();</div>
|
||||
<div class="line"><span class="lineno"> 72</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::unordered_map<int, bool></a>> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(n);</div>
|
||||
<div class="line"><span class="lineno"> 71</span> <span class="keywordtype">size_t</span> n = arr.size();</div>
|
||||
<div class="line"><span class="lineno"> 72</span> std::vector<std::unordered_map<int, bool>> <a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>(n);</div>
|
||||
<div class="line"><span class="lineno"> 73</span> <span class="keywordflow">return</span> <a class="code hl_function" href="#a280fcfb2f6fe49a31c4da572e7032607">subset_sum_recursion</a>(arr, targetSum, &<a class="code hl_namespace" href="../../df/d88/namespacedp.html">dp</a>);</div>
|
||||
<div class="line"><span class="lineno"> 74</span>}</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> partition_problem.cpp:39</div></div>
|
||||
<div class="ttc" id="asize_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector/size.html">std::vector::size</a></div><div class="ttdeci">T size(T... args)</div></div>
|
||||
<div class="ttc" id="asubset__sum__dynamic_8cpp_html_a280fcfb2f6fe49a31c4da572e7032607"><div class="ttname"><a href="#a280fcfb2f6fe49a31c4da572e7032607">dynamic_programming::subset_sum::subset_sum_recursion</a></div><div class="ttdeci">bool subset_sum_recursion(const std::vector< int > &arr, int targetSum, std::vector< std::unordered_map< int, bool > > *dp, int index=0)</div><div class="ttdef"><b>Definition</b> subset_sum_dynamic.cpp:43</div></div>
|
||||
<div class="ttc" id="avector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a></div></div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d67/subset__sum__dynamic_8cpp_ac94e6c0dee11278ac0a5491f1b9a4a50_cgraph.svg" width="527" height="135"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></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 class="ttc" id="asubset__sum__dynamic_8cpp_html_a280fcfb2f6fe49a31c4da572e7032607"><div class="ttname"><a href="#a280fcfb2f6fe49a31c4da572e7032607">dynamic_programming::subset_sum::subset_sum_recursion</a></div><div class="ttdeci">bool subset_sum_recursion(const std::vector< int > &arr, int targetSum, std::vector< std::unordered_map< int, bool > > *dp, int index=0)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d67/subset__sum__dynamic_8cpp_source.html#l00043">subset_sum_dynamic.cpp:43</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="a280fcfb2f6fe49a31c4da572e7032607" name="a280fcfb2f6fe49a31c4da572e7032607"></a>
|
||||
@@ -231,7 +244,7 @@ Here is the call graph for this function:</div>
|
||||
<tr>
|
||||
<td class="memname">bool dynamic_programming::subset_sum::subset_sum_recursion </td>
|
||||
<td>(</td>
|
||||
<td class="paramtype">const <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< int > &</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
|
||||
<td class="paramtype">const std::vector< int > &</td> <td class="paramname"><span class="paramname"><em>arr</em></span>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
@@ -241,7 +254,7 @@ Here is the call graph for this function:</div>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
<td></td>
|
||||
<td class="paramtype"><a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector</a>< <a class="elRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/unordered_map.html">std::unordered_map</a>< int, bool > > *</td> <td class="paramname"><span class="paramname"><em>dp</em></span>, </td>
|
||||
<td class="paramtype">std::vector< std::unordered_map< int, bool > > *</td> <td class="paramname"><span class="paramname"><em>dp</em></span>, </td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td class="paramkey"></td>
|
||||
@@ -259,11 +272,13 @@ Here is the call graph for this function:</div>
|
||||
</dd>
|
||||
</dl>
|
||||
<dl class="section return"><dt>Returns</dt><dd>true/false based on if the target sum subset exists or not. </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp_source.html#l00043">43</a> of file <a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp_source.html">subset_sum_dynamic.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 45</span> {</div>
|
||||
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">if</span> (targetSum == 0) { <span class="comment">// Found a valid subset with required sum.</span></div>
|
||||
<div class="line"><span class="lineno"> 47</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
|
||||
<div class="line"><span class="lineno"> 48</span> }</div>
|
||||
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">if</span> (index == arr.<a class="code hl_functionRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector/size.html">size</a>()) { <span class="comment">// End of array</span></div>
|
||||
<div class="line"><span class="lineno"> 49</span> <span class="keywordflow">if</span> (index == arr.size()) { <span class="comment">// End of array</span></div>
|
||||
<div class="line"><span class="lineno"> 50</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
|
||||
<div class="line"><span class="lineno"> 51</span> }</div>
|
||||
<div class="line"><span class="lineno"> 52</span> </div>
|
||||
@@ -277,12 +292,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><span class="lineno"> 60</span> (*dp)[index][targetSum] = ans; <span class="comment">// Save ans in dp map.</span></div>
|
||||
<div class="line"><span class="lineno"> 61</span> <span class="keywordflow">return</span> ans;</div>
|
||||
<div class="line"><span class="lineno"> 62</span>}</div>
|
||||
</div><!-- fragment --><div class="dynheader">
|
||||
Here is the call graph for this function:</div>
|
||||
<div class="dyncontent">
|
||||
<div class="center"><iframe scrolling="no" frameborder="0" src="../../dc/d67/subset__sum__dynamic_8cpp_a280fcfb2f6fe49a31c4da572e7032607_cgraph.svg" width="327" height="91"><p><b>This browser is not able to show SVG: try Firefox, Chrome, Safari, or Opera instead.</b></p></iframe></div>
|
||||
</div>
|
||||
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
|
||||
@@ -310,20 +320,22 @@ Here is the call graph for this function:</div>
|
||||
|
||||
<p>Test Function. </p>
|
||||
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
|
||||
|
||||
<p class="definition">Definition at line <a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp_source.html#l00082">82</a> of file <a class="el" href="../../dc/d67/subset__sum__dynamic_8cpp_source.html">subset_sum_dynamic.cpp</a>.</p>
|
||||
<div class="fragment"><div class="line"><span class="lineno"> 82</span> {</div>
|
||||
<div class="line"><span class="lineno"> 83</span> <span class="comment">// custom input vector</span></div>
|
||||
<div class="line"><span class="lineno"> 84</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::vector<int></a>> custom_input_arr(3);</div>
|
||||
<div class="line"><span class="lineno"> 85</span> custom_input_arr[0] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a>{1, -10, 2, 31, -6};</div>
|
||||
<div class="line"><span class="lineno"> 86</span> custom_input_arr[1] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a>{2, 3, 4};</div>
|
||||
<div class="line"><span class="lineno"> 87</span> custom_input_arr[2] = <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a>{0, 1, 0, 1, 0};</div>
|
||||
<div class="line"><span class="lineno"> 84</span> std::vector<std::vector<int>> custom_input_arr(3);</div>
|
||||
<div class="line"><span class="lineno"> 85</span> custom_input_arr[0] = std::vector<int>{1, -10, 2, 31, -6};</div>
|
||||
<div class="line"><span class="lineno"> 86</span> custom_input_arr[1] = std::vector<int>{2, 3, 4};</div>
|
||||
<div class="line"><span class="lineno"> 87</span> custom_input_arr[2] = std::vector<int>{0, 1, 0, 1, 0};</div>
|
||||
<div class="line"><span class="lineno"> 88</span> </div>
|
||||
<div class="line"><span class="lineno"> 89</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a> custom_input_target_sum(3);</div>
|
||||
<div class="line"><span class="lineno"> 89</span> std::vector<int> custom_input_target_sum(3);</div>
|
||||
<div class="line"><span class="lineno"> 90</span> custom_input_target_sum[0] = -14;</div>
|
||||
<div class="line"><span class="lineno"> 91</span> custom_input_target_sum[1] = 10;</div>
|
||||
<div class="line"><span class="lineno"> 92</span> custom_input_target_sum[2] = 2;</div>
|
||||
<div class="line"><span class="lineno"> 93</span> </div>
|
||||
<div class="line"><span class="lineno"> 94</span> <span class="comment">// calculated output vector by pal_part Function</span></div>
|
||||
<div class="line"><span class="lineno"> 95</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<int></a> calculated_output(3);</div>
|
||||
<div class="line"><span class="lineno"> 95</span> std::vector<int> calculated_output(3);</div>
|
||||
<div class="line"><span class="lineno"> 96</span> </div>
|
||||
<div class="line"><span class="lineno"> 97</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i < 3; i++) {</div>
|
||||
<div class="line"><span class="lineno"> 98</span> calculated_output[i] =</div>
|
||||
@@ -332,7 +344,7 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><span class="lineno"> 101</span> }</div>
|
||||
<div class="line"><span class="lineno"> 102</span> </div>
|
||||
<div class="line"><span class="lineno"> 103</span> <span class="comment">// expected output vector</span></div>
|
||||
<div class="line"><span class="lineno"> 104</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<bool></a> expected_output{<span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">true</span>};</div>
|
||||
<div class="line"><span class="lineno"> 104</span> std::vector<bool> expected_output{<span class="keyword">true</span>, <span class="keyword">false</span>, <span class="keyword">true</span>};</div>
|
||||
<div class="line"><span class="lineno"> 105</span> </div>
|
||||
<div class="line"><span class="lineno"> 106</span> <span class="comment">// Testing implementation via assert function</span></div>
|
||||
<div class="line"><span class="lineno"> 107</span> <span class="comment">// It will throw error if any of the expected test fails</span></div>
|
||||
@@ -341,10 +353,9 @@ Here is the call graph for this function:</div>
|
||||
<div class="line"><span class="lineno"> 110</span> assert(expected_output[i] == calculated_output[i]);</div>
|
||||
<div class="line"><span class="lineno"> 111</span> }</div>
|
||||
<div class="line"><span class="lineno"> 112</span> </div>
|
||||
<div class="line"><span class="lineno"> 113</span> <a class="code hl_classRef" target="_blank" href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a> << <span class="stringliteral">"All tests passed successfully!\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 113</span> std::cout << <span class="stringliteral">"All tests passed successfully!\n"</span>;</div>
|
||||
<div class="line"><span class="lineno"> 114</span>}</div>
|
||||
<div class="ttc" id="abasic_ostream_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/io/basic_ostream.html">std::cout</a></div></div>
|
||||
<div class="ttc" id="asubset__sum__dynamic_8cpp_html_ac94e6c0dee11278ac0a5491f1b9a4a50"><div class="ttname"><a href="#ac94e6c0dee11278ac0a5491f1b9a4a50">dynamic_programming::subset_sum::subset_sum_problem</a></div><div class="ttdeci">bool subset_sum_problem(const std::vector< int > &arr, const int targetSum)</div><div class="ttdef"><b>Definition</b> subset_sum_dynamic.cpp:70</div></div>
|
||||
<div class="ttc" id="asubset__sum__dynamic_8cpp_html_ac94e6c0dee11278ac0a5491f1b9a4a50"><div class="ttname"><a href="#ac94e6c0dee11278ac0a5491f1b9a4a50">dynamic_programming::subset_sum::subset_sum_problem</a></div><div class="ttdeci">bool subset_sum_problem(const std::vector< int > &arr, const int targetSum)</div><div class="ttdef"><b>Definition</b> <a href="../../dc/d67/subset__sum__dynamic_8cpp_source.html#l00070">subset_sum_dynamic.cpp:70</a></div></div>
|
||||
</div><!-- fragment -->
|
||||
</div>
|
||||
</div>
|
||||
|
||||
Reference in New Issue
Block a user