backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-20 20:07:45 +08:00
Code Issues Projects Releases Wiki Activity
Files
38bae2522c7b3c41d929c34d2df3254250457e9a
C-Plus-Plus/dd/d24/namespacedynamic__programming.html
realstealthninja 38bae2522c Documentation for 145111cd7e
2025-08-15 09:27:02 +00:00

483 lines
32 KiB
HTML
Raw Blame History

<!-- 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>
<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.14.0"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>TheAlgorithms/C++: dynamic_programming Namespace 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>
<script type="text/javascript" src="../../navtree.js"></script>
<script type="text/javascript" src="../../cookie.js"></script>
<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/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" 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! -->
<div id="titlearea">
<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">TheAlgorithms/C++<span id="projectnumber">&#160;1.0.0</span>
</div>
<div id="projectbrief">All the algorithms implemented in C++</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.14.0 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "../../search/",'.html');
</script>
<script type="text/javascript">
$(function() { codefold.init(); });
</script>
<script type="text/javascript" src="../../menudata.js"></script>
<script type="text/javascript" src="../../menu.js"></script>
<script type="text/javascript">
$(function() {
initMenu('../../',true,false,'search.php','Search',true);
$(function() { init_search(); });
});
</script>
<div id="main-nav"></div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(function(){initNavTree('dd/d24/namespacedynamic__programming.html','../../',''); });
</script>
<div id="container">
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<div id="MSearchResults">
<div class="SRPage">
<div id="SRIndex">
<div id="SRResults"></div>
<div class="SRStatus" id="Loading">Loading...</div>
<div class="SRStatus" id="Searching">Searching...</div>
<div class="SRStatus" id="NoMatches">No Matches</div>
</div>
</div>
</div>
</div>
<div class="header">
<div class="headertitle"><div class="title">dynamic_programming Namespace Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Dynamic Programming algorithms.
<a href="#details">More...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-func-members" class="groupheader"><a id="func-members" name="func-members"></a>
Functions</h2></td></tr>
<tr class="memitem:af046365a8d77a1267acc082f86135a26" id="r_af046365a8d77a1267acc082f86135a26"><td class="memTemplParams" colspan="2">template&lt;typename T&gt; </td></tr>
<tr class="memitem:af046365a8d77a1267acc082f86135a26 template"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af046365a8d77a1267acc082f86135a26">is_armstrong</a> (const T &amp;number)</td></tr>
<tr class="memdesc:af046365a8d77a1267acc082f86135a26"><td class="mdescLeft">&#160;</td><td class="mdescRight">Checks if the given number is armstrong or not. <br /></td></tr>
<tr class="memitem:a0a2215194e58786c34db1ccaf8031079" id="r_a0a2215194e58786c34db1ccaf8031079"><td class="memItemLeft" align="right" valign="top">uint64_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a0a2215194e58786c34db1ccaf8031079">LIS</a> (const std::vector&lt; uint64_t &gt; &amp;a, const uint32_t &amp;n)</td></tr>
<tr class="memdesc:a0a2215194e58786c34db1ccaf8031079"><td class="mdescLeft">&#160;</td><td class="mdescRight">Calculate the longest increasing subsequence for the specified numbers. <br /></td></tr>
<tr class="memitem:afe9f45b6e30ee187509da2d1d0093412" id="r_afe9f45b6e30ee187509da2d1d0093412"><td class="memItemLeft" align="right" valign="top">std::string&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#afe9f45b6e30ee187509da2d1d0093412">lps</a> (const std::string &amp;a)</td></tr>
<tr class="memdesc:afe9f45b6e30ee187509da2d1d0093412"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function that returns the longest palindromic subsequence of a string. <br /></td></tr>
<tr class="memitem:a5239174fa0d987f2c67edc1f2af82beb" id="r_a5239174fa0d987f2c67edc1f2af82beb"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a5239174fa0d987f2c67edc1f2af82beb">maxCircularSum</a> (std::vector&lt; int &gt; &amp;arr)</td></tr>
<tr class="memdesc:a5239174fa0d987f2c67edc1f2af82beb"><td class="mdescLeft">&#160;</td><td class="mdescRight">returns the maximum contiguous circular sum of an array <br /></td></tr>
<tr class="memitem:a066e0e739e7c276eee6e61d5b4d37ce8" id="r_a066e0e739e7c276eee6e61d5b4d37ce8"><td class="memItemLeft" align="right" valign="top">uint32_t&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#a066e0e739e7c276eee6e61d5b4d37ce8">trappedRainwater</a> (const std::vector&lt; uint32_t &gt; &amp;heights)</td></tr>
<tr class="memdesc:a066e0e739e7c276eee6e61d5b4d37ce8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Function to calculate the trapped rainwater. <br /></td></tr>
</table>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Dynamic Programming algorithms. </p>
<p>Dynamic programming algorithms.</p>
<p>Namespace for dynamic programming algorithms.</p>
<p>For std::vector.</p>
<p>for std::vector</p>
<p>Dynamic Programming algorithm.</p>
<p>for IO operations</p>
<p>Dynamic Programming Algorithms.</p>
<p>for <span class="tt">assert</span> for <span class="tt">std::uint32_t</span> for IO operations for <span class="tt">std::string</span> library for <span class="tt">std::vector</span> STL library</p>
<p>for assert for std::pow</p>
<p>Dynamic Programming algorithms</p>
<p>for assert for std::max for std::uint32_t for io operations</p>
<p>Dynamic Programming algorithms</p>
<p>for assert for std::max for std::uint64_t for IO operations</p>
<p>Dynamic Programming algorithms</p>
<p>for assert for std::string for std::vector</p>
<p>for assert for IO operations</p>
<p>Dynamic Programming algorithms</p>
<p>for assert for std::uint64_t for IO operations</p>
<p>Dynamic Programming algorithms</p>
<p>for std::assert for IO operations for unordered map</p>
<p>Dynamic Programming algorithms</p>
<p>For std::min and std::max For assert For std::size_t</p>
<p>For std::min and std::max For assert For std::size_t For std::uint32_t For std::vector </p>
</div><a name="doc-func-members" id="doc-func-members"></a><h2 id="header-doc-func-members" class="groupheader">Function Documentation</h2>
<a id="af046365a8d77a1267acc082f86135a26" name="af046365a8d77a1267acc082f86135a26"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af046365a8d77a1267acc082f86135a26">&#9670;&#160;</a></span>is_armstrong()</h2>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="memname">
<tr>
<td class="memname">bool dynamic_programming::is_armstrong </td>
<td>(</td>
<td class="paramtype">const T &amp;</td> <td class="paramname"><span class="paramname"><em>number</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Checks if the given number is armstrong or not. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">number</td><td>the number to check </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>false if the given number is NOT armstrong </dd>
<dd>
true if the given number IS armstrong </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d1/da7/armstrong__number__templated_8cpp_source.html#l00039">39</a> of file <a class="el" href="../../d1/da7/armstrong__number__templated_8cpp_source.html">armstrong_number_templated.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 39</span> {</div>
<div class="line"><span class="lineno"> 40</span> <span class="keywordtype">int</span> count = 0, temp = number, result = 0, rem = 0;</div>
<div class="line"><span class="lineno"> 41</span> </div>
<div class="line"><span class="lineno"> 42</span> <span class="comment">// Count the number of digits of the given number.</span></div>
<div class="line"><span class="lineno"> 43</span> <span class="comment">// For example: 153 would be 3 digits.</span></div>
<div class="line"><span class="lineno"> 44</span> <span class="keywordflow">while</span> (temp != 0) {</div>
<div class="line"><span class="lineno"> 45</span> temp /= 10;</div>
<div class="line"><span class="lineno"> 46</span> count++;</div>
<div class="line"><span class="lineno"> 47</span> }</div>
<div class="line"><span class="lineno"> 48</span> </div>
<div class="line"><span class="lineno"> 49</span> <span class="comment">// Calculation for checking of armstrongs number i.e.</span></div>
<div class="line"><span class="lineno"> 50</span> <span class="comment">// in an n-digit number sum of the digits is raised to a power of `n` is</span></div>
<div class="line"><span class="lineno"> 51</span> <span class="comment">// equal to the original number.</span></div>
<div class="line"><span class="lineno"> 52</span> temp = number;</div>
<div class="line"><span class="lineno"> 53</span> <span class="keywordflow">while</span> (temp != 0) {</div>
<div class="line"><span class="lineno"> 54</span> rem = temp % 10;</div>
<div class="line"><span class="lineno"> 55</span> result += <span class="keyword">static_cast&lt;</span>T<span class="keyword">&gt;</span>(std::pow(rem, count));</div>
<div class="line"><span class="lineno"> 56</span> temp /= 10;</div>
<div class="line"><span class="lineno"> 57</span> }</div>
<div class="line"><span class="lineno"> 58</span> </div>
<div class="line"><span class="lineno"> 59</span> <span class="keywordflow">if</span> (result == number) {</div>
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 61</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 62</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 63</span> }</div>
<div class="line"><span class="lineno"> 64</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a0a2215194e58786c34db1ccaf8031079" name="a0a2215194e58786c34db1ccaf8031079"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a0a2215194e58786c34db1ccaf8031079">&#9670;&#160;</a></span>LIS()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">uint64_t dynamic_programming::LIS </td>
<td>(</td>
<td class="paramtype">const std::vector&lt; uint64_t &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>a</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const uint32_t &amp;</td> <td class="paramname"><span class="paramname"><em>n</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>Calculate the longest increasing subsequence for the specified numbers. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">a</td><td>the array used to calculate the longest increasing subsequence </td></tr>
<tr><td class="paramname">n</td><td>the size used for the arrays </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>the length of the longest increasing subsequence in the <span class="tt">a</span> array of size <span class="tt">n</span> </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d7/d57/longest__increasing__subsequence_8cpp_source.html#l00040">40</a> of file <a class="el" href="../../d7/d57/longest__increasing__subsequence_8cpp_source.html">longest_increasing_subsequence.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 40</span> {</div>
<div class="line"><span class="lineno"> 41</span> std::vector&lt;int&gt; lis(n);</div>
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
<div class="line"><span class="lineno"> 43</span> lis[i] = 1;</div>
<div class="line"><span class="lineno"> 44</span> }</div>
<div class="line"><span class="lineno"> 45</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
<div class="line"><span class="lineno"> 46</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; i; ++j) {</div>
<div class="line"><span class="lineno"> 47</span> <span class="keywordflow">if</span> (a[i] &gt; a[j] &amp;&amp; lis[i] &lt; lis[j] + 1) {</div>
<div class="line"><span class="lineno"> 48</span> lis[i] = lis[j] + 1;</div>
<div class="line"><span class="lineno"> 49</span> }</div>
<div class="line"><span class="lineno"> 50</span> }</div>
<div class="line"><span class="lineno"> 51</span> }</div>
<div class="line"><span class="lineno"> 52</span> <span class="keywordtype">int</span> res = 0;</div>
<div class="line"><span class="lineno"> 53</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; n; ++i) {</div>
<div class="line"><span class="lineno"> 54</span> res = std::max(res, lis[i]);</div>
<div class="line"><span class="lineno"> 55</span> }</div>
<div class="line"><span class="lineno"> 56</span> <span class="keywordflow">return</span> res;</div>
<div class="line"><span class="lineno"> 57</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="afe9f45b6e30ee187509da2d1d0093412" name="afe9f45b6e30ee187509da2d1d0093412"></a>
<h2 class="memtitle"><span class="permalink"><a href="#afe9f45b6e30ee187509da2d1d0093412">&#9670;&#160;</a></span>lps()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">std::string dynamic_programming::lps </td>
<td>(</td>
<td class="paramtype">const std::string &amp;</td> <td class="paramname"><span class="paramname"><em>a</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Function that returns the longest palindromic subsequence of a string. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">a</td><td>string whose longest palindromic subsequence is to be found </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>longest palindromic subsequence of the string </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d0/d77/longest__palindromic__subsequence_8cpp_source.html#l00031">31</a> of file <a class="el" href="../../d0/d77/longest__palindromic__subsequence_8cpp_source.html">longest_palindromic_subsequence.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 31</span> {</div>
<div class="line"><span class="lineno"> 32</span> <span class="keyword">const</span> <span class="keyword">auto</span> b = std::string(a.rbegin(), a.rend());</div>
<div class="line"><span class="lineno"> 33</span> <span class="keyword">const</span> <span class="keyword">auto</span> m = a.length();</div>
<div class="line"><span class="lineno"> 34</span> <span class="keyword">using </span>ind_type = std::string::size_type;</div>
<div class="line"><span class="lineno"> 35</span> std::vector&lt;std::vector&lt;ind_type&gt; &gt; res(m + 1,</div>
<div class="line"><span class="lineno"> 36</span> std::vector&lt;ind_type&gt;(m + 1));</div>
<div class="line"><span class="lineno"> 37</span> </div>
<div class="line"><span class="lineno"> 38</span> <span class="comment">// Finding the length of the longest</span></div>
<div class="line"><span class="lineno"> 39</span> <span class="comment">// palindromic subsequence and storing</span></div>
<div class="line"><span class="lineno"> 40</span> <span class="comment">// in a 2D array in bottoms-up manner</span></div>
<div class="line"><span class="lineno"> 41</span> <span class="keywordflow">for</span> (ind_type i = 0; i &lt;= m; i++) {</div>
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">for</span> (ind_type j = 0; j &lt;= m; j++) {</div>
<div class="line"><span class="lineno"> 43</span> <span class="keywordflow">if</span> (i == 0 || j == 0) {</div>
<div class="line"><span class="lineno"> 44</span> res[i][j] = 0;</div>
<div class="line"><span class="lineno"> 45</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (a[i - 1] == b[j - 1]) {</div>
<div class="line"><span class="lineno"> 46</span> res[i][j] = res[i - 1][j - 1] + 1;</div>
<div class="line"><span class="lineno"> 47</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 48</span> res[i][j] = std::max(res[i - 1][j], res[i][j - 1]);</div>
<div class="line"><span class="lineno"> 49</span> }</div>
<div class="line"><span class="lineno"> 50</span> }</div>
<div class="line"><span class="lineno"> 51</span> }</div>
<div class="line"><span class="lineno"> 52</span> <span class="comment">// Length of longest palindromic subsequence</span></div>
<div class="line"><span class="lineno"> 53</span> <span class="keyword">auto</span> idx = res[m][m];</div>
<div class="line"><span class="lineno"> 54</span> <span class="comment">// Creating string of index+1 length</span></div>
<div class="line"><span class="lineno"> 55</span> std::string ans(idx, <span class="charliteral">&#39;\0&#39;</span>);</div>
<div class="line"><span class="lineno"> 56</span> ind_type i = m, j = m;</div>
<div class="line"><span class="lineno"> 57</span> </div>
<div class="line"><span class="lineno"> 58</span> <span class="comment">// starting from right-most bottom-most corner</span></div>
<div class="line"><span class="lineno"> 59</span> <span class="comment">// and storing them one by one in ans</span></div>
<div class="line"><span class="lineno"> 60</span> <span class="keywordflow">while</span> (i &gt; 0 &amp;&amp; j &gt; 0) {</div>
<div class="line"><span class="lineno"> 61</span> <span class="comment">// if current characters in a and b are same</span></div>
<div class="line"><span class="lineno"> 62</span> <span class="comment">// then it is a part of the ans</span></div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordflow">if</span> (a[i - 1] == b[j - 1]) {</div>
<div class="line"><span class="lineno"> 64</span> ans[idx - 1] = a[i - 1];</div>
<div class="line"><span class="lineno"> 65</span> i--;</div>
<div class="line"><span class="lineno"> 66</span> j--;</div>
<div class="line"><span class="lineno"> 67</span> idx--;</div>
<div class="line"><span class="lineno"> 68</span> }</div>
<div class="line"><span class="lineno"> 69</span> <span class="comment">// If they are not same, find the larger of the</span></div>
<div class="line"><span class="lineno"> 70</span> <span class="comment">// two and move in that direction</span></div>
<div class="line"><span class="lineno"> 71</span> <span class="keywordflow">else</span> <span class="keywordflow">if</span> (res[i - 1][j] &gt; res[i][j - 1]) {</div>
<div class="line"><span class="lineno"> 72</span> i--;</div>
<div class="line"><span class="lineno"> 73</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 74</span> j--;</div>
<div class="line"><span class="lineno"> 75</span> }</div>
<div class="line"><span class="lineno"> 76</span> }</div>
<div class="line"><span class="lineno"> 77</span> </div>
<div class="line"><span class="lineno"> 78</span> <span class="keywordflow">return</span> ans;</div>
<div class="line"><span class="lineno"> 79</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a5239174fa0d987f2c67edc1f2af82beb" name="a5239174fa0d987f2c67edc1f2af82beb"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a5239174fa0d987f2c67edc1f2af82beb">&#9670;&#160;</a></span>maxCircularSum()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int dynamic_programming::maxCircularSum </td>
<td>(</td>
<td class="paramtype">std::vector&lt; int &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>arr</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>returns the maximum contiguous circular sum of an array </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">arr</td><td>is the array/vector </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>int which is the maximum sum </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../db/dfb/maximum__circular__subarray_8cpp_source.html#l00026">26</a> of file <a class="el" href="../../db/dfb/maximum__circular__subarray_8cpp_source.html">maximum_circular_subarray.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 27</span>{</div>
<div class="line"><span class="lineno"> 28</span> <span class="comment">// Edge Case</span></div>
<div class="line"><span class="lineno"> 29</span> <span class="keywordflow">if</span> (arr.size() == 1)</div>
<div class="line"><span class="lineno"> 30</span> <span class="keywordflow">return</span> arr[0];</div>
<div class="line"><span class="lineno"> 31</span> </div>
<div class="line"><span class="lineno"> 32</span> <span class="comment">// Sum variable which stores total sum of the array.</span></div>
<div class="line"><span class="lineno"> 33</span> <span class="keywordtype">int</span> sum = 0;</div>
<div class="line"><span class="lineno"> 34</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; arr.size(); i++) {</div>
<div class="line"><span class="lineno"> 35</span> sum += arr[i];</div>
<div class="line"><span class="lineno"> 36</span> }</div>
<div class="line"><span class="lineno"> 37</span> </div>
<div class="line"><span class="lineno"> 38</span> <span class="comment">// Every variable stores first value of the array.</span></div>
<div class="line"><span class="lineno"> 39</span> <span class="keywordtype">int</span> current_max = arr[0], max_so_far = arr[0], current_min = arr[0], min_so_far = arr[0];</div>
<div class="line"><span class="lineno"> 40</span> </div>
<div class="line"><span class="lineno"> 41</span> <span class="comment">// Concept of Kadane&#39;s Algorithm</span></div>
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 1; i &lt; arr.size(); i++) {</div>
<div class="line"><span class="lineno"> 43</span> <span class="comment">// Kadane&#39;s Algorithm to find Maximum subarray sum.</span></div>
<div class="line"><span class="lineno"> 44</span> current_max = std::max(current_max + arr[i], arr[i]);</div>
<div class="line"><span class="lineno"> 45</span> max_so_far = std::max(max_so_far, current_max);</div>
<div class="line"><span class="lineno"> 46</span> </div>
<div class="line"><span class="lineno"> 47</span> <span class="comment">// Kadane&#39;s Algorithm to find Minimum subarray sum.</span></div>
<div class="line"><span class="lineno"> 48</span> current_min = std::min(current_min + arr[i], arr[i]);</div>
<div class="line"><span class="lineno"> 49</span> min_so_far = std::min(min_so_far, current_min);</div>
<div class="line"><span class="lineno"> 50</span> }</div>
<div class="line"><span class="lineno"> 51</span> </div>
<div class="line"><span class="lineno"> 52</span> <span class="keywordflow">if</span> (min_so_far == sum)</div>
<div class="line"><span class="lineno"> 53</span> <span class="keywordflow">return</span> max_so_far;</div>
<div class="line"><span class="lineno"> 54</span> </div>
<div class="line"><span class="lineno"> 55</span> <span class="comment">// Return the maximum value</span></div>
<div class="line"><span class="lineno"> 56</span> <span class="keywordflow">return</span> std::max(max_so_far, sum - min_so_far);</div>
<div class="line"><span class="lineno"> 57</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="a066e0e739e7c276eee6e61d5b4d37ce8" name="a066e0e739e7c276eee6e61d5b4d37ce8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a066e0e739e7c276eee6e61d5b4d37ce8">&#9670;&#160;</a></span>trappedRainwater()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">uint32_t dynamic_programming::trappedRainwater </td>
<td>(</td>
<td class="paramtype">const std::vector&lt; uint32_t &gt; &amp;</td> <td class="paramname"><span class="paramname"><em>heights</em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<p>Function to calculate the trapped rainwater. </p>
<dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">heights</td><td>Array representing the heights of walls </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd>The amount of trapped rainwater </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d9/d80/trapped__rainwater_8cpp_source.html#l00027">27</a> of file <a class="el" href="../../d9/d80/trapped__rainwater_8cpp_source.html">trapped_rainwater.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 27</span> {</div>
<div class="line"><span class="lineno"> 28</span> std::size_t n = heights.size();</div>
<div class="line"><span class="lineno"> 29</span> <span class="keywordflow">if</span> (n &lt;= 2)</div>
<div class="line"><span class="lineno"> 30</span> <span class="keywordflow">return</span> 0; <span class="comment">// No water can be trapped with less than 3 walls</span></div>
<div class="line"><span class="lineno"> 31</span> </div>
<div class="line"><span class="lineno"> 32</span> std::vector&lt;uint32_t&gt; leftMax(n), rightMax(n);</div>
<div class="line"><span class="lineno"> 33</span> </div>
<div class="line"><span class="lineno"> 34</span> <span class="comment">// Calculate the maximum height of wall to the left of each wall</span></div>
<div class="line"><span class="lineno"> 35</span> leftMax[0] = heights[0];</div>
<div class="line"><span class="lineno"> 36</span> <span class="keywordflow">for</span> (std::size_t i = 1; i &lt; n; ++i) {</div>
<div class="line"><span class="lineno"> 37</span> leftMax[i] = std::max(leftMax[i - 1], heights[i]);</div>
<div class="line"><span class="lineno"> 38</span> }</div>
<div class="line"><span class="lineno"> 39</span> </div>
<div class="line"><span class="lineno"> 40</span> <span class="comment">// Calculate the maximum height of wall to the right of each wall</span></div>
<div class="line"><span class="lineno"> 41</span> rightMax[n - 1] = heights[n - 1];</div>
<div class="line"><span class="lineno"> 42</span> <span class="keywordflow">for</span> (std::size_t i = n - 2; i &lt; n; --i) {</div>
<div class="line"><span class="lineno"> 43</span> rightMax[i] = std::max(rightMax[i + 1], heights[i]);</div>
<div class="line"><span class="lineno"> 44</span> }</div>
<div class="line"><span class="lineno"> 45</span> </div>
<div class="line"><span class="lineno"> 46</span> <span class="comment">// Calculate the trapped rainwater between walls</span></div>
<div class="line"><span class="lineno"> 47</span> uint32_t trappedWater = 0;</div>
<div class="line"><span class="lineno"> 48</span> <span class="keywordflow">for</span> (std::size_t i = 0; i &lt; n; ++i) {</div>
<div class="line"><span class="lineno"> 49</span> trappedWater +=</div>
<div class="line"><span class="lineno"> 50</span> std::max(0u, std::min(leftMax[i], rightMax[i]) - heights[i]);</div>
<div class="line"><span class="lineno"> 51</span> }</div>
<div class="line"><span class="lineno"> 52</span> </div>
<div class="line"><span class="lineno"> 53</span> <span class="keywordflow">return</span> trappedWater;</div>
<div class="line"><span class="lineno"> 54</span>}</div>
</div><!-- fragment -->
</div>
</div>
</div><!-- contents -->
</div><!-- doc-content -->
<div id="page-nav" class="page-nav-panel">
<div id="page-nav-resize-handle"></div>
<div id="page-nav-tree">
<div id="page-nav-contents">
</div><!-- page-nav-contents -->
</div><!-- page-nav-tree -->
</div><!-- page-nav -->
</div><!-- container -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</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.14.0 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink