backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-03-21 04:18:34 +08:00
Code Issues Projects Releases Wiki Activity
Files
42c0cd0dd91c20102c367e5b44a17a19d9c10cf1
C-Plus-Plus/d7/d73/abbreviation_8cpp.html
realstealthninja b41207008f Documentation for f1eddf4d65
2025-07-09 10:53:16 +00:00

441 lines
34 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/abbreviation.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>
<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('d7/d73/abbreviation_8cpp.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">abbreviation.cpp File Reference</div></div>
</div><!--header-->
<div class="contents">
<p>Implementation of <a href="https://www.hackerrank.com/challenges/abbr/problem" target="_blank">Abbrievation</a>
<a href="#details">More...</a></p>
<div class="textblock"><code>#include &lt;cassert&gt;</code><br />
<code>#include &lt;cstdint&gt;</code><br />
<code>#include &lt;iostream&gt;</code><br />
<code>#include &lt;string&gt;</code><br />
<code>#include &lt;vector&gt;</code><br />
</div><div class="textblock"><div class="dynheader">
Include dependency graph for abbreviation.cpp:</div>
<div class="dyncontent">
<div class="center"><iframe scrolling="no" loading="lazy" frameborder="0" src="../../da/d76/abbreviation_8cpp__incl.svg" width="415" 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>
<p><a href="../../d7/d73/abbreviation_8cpp_source.html">Go to the source code of this file.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 id="header-namespaces" class="groupheader"><a id="namespaces" name="namespaces"></a>
Namespaces</h2></td></tr>
<tr class="memitem:dynamic_5Fprogramming" id="r_dynamic_5Fprogramming"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../dd/d24/namespacedynamic__programming.html">dynamic_programming</a></td></tr>
<tr class="memdesc:dd/d24/namespacedynamic__programming"><td class="mdescLeft">&#160;</td><td class="mdescRight">Dynamic Programming algorithms. <br /></td></tr>
<tr class="memitem:abbreviation" id="r_abbreviation"><td class="memItemLeft" align="right" valign="top">namespace &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/df8/namespaceabbreviation.html">abbreviation</a></td></tr>
<tr class="memdesc:d0/df8/namespaceabbreviation"><td class="mdescLeft">&#160;</td><td class="mdescRight">Functions for <a href="https://www.hackerrank.com/challenges/abbr/problem" target="_blank">Abbreviation</a> implementation. <br /></td></tr>
</table><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:add60b8858720bf217df22d992d0fefaa" id="r_add60b8858720bf217df22d992d0fefaa"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a> (std::vector&lt; std::vector&lt; bool &gt; &gt; *memo, std::vector&lt; std::vector&lt; bool &gt; &gt; *visited, const std::string &amp;str, const std::string &amp;result, uint32_t str_idx=0, uint32_t result_idx=0)</td></tr>
<tr class="memdesc:add60b8858720bf217df22d992d0fefaa"><td class="mdescLeft">&#160;</td><td class="mdescRight">Recursive Dynamic Programming function. <br /></td></tr>
<tr class="memitem:af53b2f647bee9c5b75ef8dd9ef685dc8" id="r_af53b2f647bee9c5b75ef8dd9ef685dc8"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a> (const std::string &amp;str, const std::string &amp;result)</td></tr>
<tr class="memdesc:af53b2f647bee9c5b75ef8dd9ef685dc8"><td class="mdescLeft">&#160;</td><td class="mdescRight">Iterative Dynamic Programming function. <br /></td></tr>
<tr class="memitem:aa8dca7b867074164d5f45b0f3851269d" id="r_aa8dca7b867074164d5f45b0f3851269d"><td class="memItemLeft" align="right" valign="top">static void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#aa8dca7b867074164d5f45b0f3851269d">test</a> ()</td></tr>
<tr class="memdesc:aa8dca7b867074164d5f45b0f3851269d"><td class="mdescLeft">&#160;</td><td class="mdescRight">Self test-implementations. <br /></td></tr>
<tr class="memitem:ae66f6b31b5ad750f1fe042a706a4e3d4" id="r_ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="#ae66f6b31b5ad750f1fe042a706a4e3d4">main</a> ()</td></tr>
<tr class="memdesc:ae66f6b31b5ad750f1fe042a706a4e3d4"><td class="mdescLeft">&#160;</td><td class="mdescRight">Main function. <br /></td></tr>
</table>
<a name="details" id="details"></a><h2 id="header-details" class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Implementation of <a href="https://www.hackerrank.com/challenges/abbr/problem" target="_blank">Abbrievation</a> </p>
<p>Given two strings, <span class="tt">a</span> and <span class="tt">b</span>, determine if it's possible to make <span class="tt">a</span> equal to <span class="tt">b</span> You can perform the following operations on the string <span class="tt">a</span>:</p><ol type="1">
<li>Capitalize zero or more of <span class="tt">a</span>'s lowercase letters.</li>
<li>Delete all of the remaining lowercase letters in <span class="tt">a</span>.</li>
</ol>
<h3 class="doxsection"><a class="anchor" id="autotoc_md70"></a>
Algorithm</h3>
<p>The idea is in the problem statement itself: iterate through characters of string <span class="tt">a</span> and <span class="tt">b</span> (for character indexes <span class="tt">i</span> and <span class="tt">j</span> respectively):</p><ol type="1">
<li>If <span class="tt">a[i]</span> and <span class="tt">b[j]</span> are equal, then move to next position</li>
<li>If <span class="tt">a[i]</span> is lowercase of <span class="tt">b[j]</span>, then explore two possibilities: a. Capitalize <span class="tt">a[i]</span> or b. Skip <span class="tt">a[i]</span></li>
<li>If the <span class="tt">a[i]</span> is not uppercase, just discard that character, else return <span class="tt">false</span></li>
</ol>
<p>Time Complexity: (O(|a|*|b|)) where <span class="tt">|a|</span> =&gt; length of string <span class="tt">a</span> </p><dl class="section author"><dt>Author</dt><dd><a href="https://github.com/AshishYUO" target="_blank">Ashish Daulatabad</a> </dd></dl>
<p class="definition">Definition in file <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html">abbreviation.cpp</a>.</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="af53b2f647bee9c5b75ef8dd9ef685dc8" name="af53b2f647bee9c5b75ef8dd9ef685dc8"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af53b2f647bee9c5b75ef8dd9ef685dc8">&#9670;&#160;</a></span>abbreviation()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool dynamic_programming::abbreviation::abbreviation </td>
<td>(</td>
<td class="paramtype">const std::string &amp;</td> <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const std::string &amp;</td> <td class="paramname"><span class="paramname"><em>result</em></span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>Iterative Dynamic Programming function. </p>
<p>Returns whether <span class="tt">s</span> can be converted to <span class="tt">t</span> with following rules: a. Capitalize zero or more of s's lowercase letters from string <span class="tt">s</span> b. remove all other lowercase letters from string <span class="tt">s</span> Note: The transition states for iterative is similar to recursive as well </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">str</td><td>given string, which might not be abbreivated </td></tr>
<tr><td class="paramname">result</td><td>resultant abbreivated string </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd><span class="tt">false</span> if string <span class="tt">str</span> cannot be converted to <span class="tt">result</span> </dd>
<dd>
<span class="tt">true</span> if string <span class="tt">str</span> can be converted to <span class="tt">result</span> </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html#l00119">119</a> of file <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html">abbreviation.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 119</span> {</div>
<div class="line"><span class="lineno"> 120</span> std::vector&lt;std::vector&lt;bool&gt;&gt; memo(</div>
<div class="line"><span class="lineno"> 121</span> str.size() + 1, std::vector&lt;bool&gt;(result.size() + 1, <span class="keyword">false</span>));</div>
<div class="line"><span class="lineno"> 122</span> </div>
<div class="line"><span class="lineno"> 123</span> <span class="keywordflow">for</span> (uint32_t i = 0; i &lt;= str.size(); ++i) {</div>
<div class="line"><span class="lineno"> 124</span> memo[i][0] = <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 125</span> }</div>
<div class="line"><span class="lineno"> 126</span> <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= result.size(); ++i) {</div>
<div class="line"><span class="lineno"> 127</span> memo[0][i] = <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 128</span> }</div>
<div class="line"><span class="lineno"> 129</span> <span class="keywordflow">for</span> (uint32_t i = 1; i &lt;= str.size(); ++i) {</div>
<div class="line"><span class="lineno"> 130</span> <span class="keywordflow">for</span> (uint32_t j = 1; j &lt;= result.size(); ++j) {</div>
<div class="line"><span class="lineno"> 131</span> <span class="keywordflow">if</span> (str[i - 1] == result[j - 1]) {</div>
<div class="line"><span class="lineno"> 132</span> memo[i][j] = memo[i - 1][j - 1];</div>
<div class="line"><span class="lineno"> 133</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str[i - 1] - 32 == result[j - 1]) {</div>
<div class="line"><span class="lineno"> 134</span> memo[i][j] = (memo[i - 1][j - 1] || memo[i - 1][j]);</div>
<div class="line"><span class="lineno"> 135</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 136</span> <span class="keywordflow">if</span> (str[i - 1] &gt;= <span class="charliteral">&#39;A&#39;</span> &amp;&amp; str[i - 1] &lt;= <span class="charliteral">&#39;Z&#39;</span>) {</div>
<div class="line"><span class="lineno"> 137</span> memo[i][j] = <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 138</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 139</span> memo[i][j] = memo[i - 1][j];</div>
<div class="line"><span class="lineno"> 140</span> }</div>
<div class="line"><span class="lineno"> 141</span> }</div>
<div class="line"><span class="lineno"> 142</span> }</div>
<div class="line"><span class="lineno"> 143</span> }</div>
<div class="line"><span class="lineno"> 144</span> <span class="keywordflow">return</span> memo.back().back();</div>
<div class="line"><span class="lineno"> 145</span>}</div>
</div><!-- fragment -->
</div>
</div>
<a id="add60b8858720bf217df22d992d0fefaa" name="add60b8858720bf217df22d992d0fefaa"></a>
<h2 class="memtitle"><span class="permalink"><a href="#add60b8858720bf217df22d992d0fefaa">&#9670;&#160;</a></span>abbreviation_recursion()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">bool dynamic_programming::abbreviation::abbreviation_recursion </td>
<td>(</td>
<td class="paramtype">std::vector&lt; std::vector&lt; bool &gt; &gt; *</td> <td class="paramname"><span class="paramname"><em>memo</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">std::vector&lt; std::vector&lt; bool &gt; &gt; *</td> <td class="paramname"><span class="paramname"><em>visited</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const std::string &amp;</td> <td class="paramname"><span class="paramname"><em>str</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">const std::string &amp;</td> <td class="paramname"><span class="paramname"><em>result</em></span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint32_t</td> <td class="paramname"><span class="paramname"><em>str_idx</em></span><span class="paramdefsep"> = </span><span class="paramdefval">0</span>, </td>
</tr>
<tr>
<td class="paramkey"></td>
<td></td>
<td class="paramtype">uint32_t</td> <td class="paramname"><span class="paramname"><em>result_idx</em></span><span class="paramdefsep"> = </span><span class="paramdefval">0</span>&#160;)</td>
</tr>
</table>
</div><div class="memdoc">
<p>Recursive Dynamic Programming function. </p>
<p>Returns whether <span class="tt">s</span> can be converted to <span class="tt">t</span> with following rules: a. Capitalize zero or more of a's lowercase letters from string <span class="tt">s</span> b. remove all other lowercase letters from string <span class="tt">s</span> </p><dl class="params"><dt>Parameters</dt><dd>
<table class="params">
<tr><td class="paramname">memo</td><td>To store the result </td></tr>
<tr><td class="paramname">visited</td><td>boolean to check if the result is already computed </td></tr>
<tr><td class="paramname">str</td><td>given string, which might not be abbreivated </td></tr>
<tr><td class="paramname">result</td><td>resultant abbreivated string </td></tr>
<tr><td class="paramname">str_idx</td><td>index for string <span class="tt">str</span>, helpful for transitions </td></tr>
<tr><td class="paramname">result_idx</td><td>index for string <span class="tt">result</span>, helpful for transitions </td></tr>
</table>
</dd>
</dl>
<dl class="section return"><dt>Returns</dt><dd><span class="tt">false</span> if string <span class="tt">str</span> cannot be converted to <span class="tt">result</span> </dd>
<dd>
<span class="tt">true</span> if string <span class="tt">str</span> can be converted to <span class="tt">result</span> </dd></dl>
<p><span class="tt">(str[i] == result[j])</span>: if str char at position i is equal to <span class="tt">result</span> char at position j, then s character is a capitalized one, move on to next character <span class="tt">str[i] - 32 == result[j]</span>: if <span class="tt">str[i]</span> character is lowercase of <span class="tt">result[j]</span> then explore two possibilites:</p><ol type="1">
<li>convert it to capitalized letter and move both to next pointer <span class="tt">(i + 1, j + 1)</span></li>
<li>Discard the character <span class="tt">(str[i])</span> and move to next char <span class="tt">(i + 1,
j)</span></li>
</ol>
<p class="definition">Definition at line <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html#l00059">59</a> of file <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html">abbreviation.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 62</span> {</div>
<div class="line"><span class="lineno"> 63</span> <span class="keywordtype">bool</span> ans = memo-&gt;at(str_idx).at(result_idx);</div>
<div class="line"><span class="lineno"> 64</span> <span class="keywordflow">if</span> (str_idx == str.size() &amp;&amp; result_idx == result.size()) {</div>
<div class="line"><span class="lineno"> 65</span> <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 66</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str_idx == str.size() &amp;&amp; result_idx != result.size()) {</div>
<div class="line"><span class="lineno"> 67</span> <span class="comment">// result `t` is not converted, return false</span></div>
<div class="line"><span class="lineno"> 68</span> <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 69</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!visited-&gt;at(str_idx).at(result_idx)) {</div>
<div class="line"><span class="lineno"> 81</span> <span class="keywordflow">if</span> (str[str_idx] == result[result_idx]) {</div>
<div class="line"><span class="lineno"> 82</span> ans = abbreviation_recursion(memo, visited, str, result,</div>
<div class="line"><span class="lineno"> 83</span> str_idx + 1, result_idx + 1);</div>
<div class="line"><span class="lineno"> 84</span> } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (str[str_idx] - 32 == result[result_idx]) {</div>
<div class="line"><span class="lineno"> 85</span> ans = <a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
<div class="line"><span class="lineno"> 86</span> str_idx + 1, result_idx + 1) ||</div>
<div class="line"><span class="lineno"> 87</span> <a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
<div class="line"><span class="lineno"> 88</span> str_idx + 1, result_idx);</div>
<div class="line"><span class="lineno"> 89</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 90</span> <span class="comment">// if `str[i]` is uppercase, then cannot be converted, return</span></div>
<div class="line"><span class="lineno"> 91</span> <span class="comment">// `false`</span></div>
<div class="line"><span class="lineno"> 92</span> <span class="comment">// else `str[i]` is lowercase, only option is to discard this</span></div>
<div class="line"><span class="lineno"> 93</span> <span class="comment">// character</span></div>
<div class="line"><span class="lineno"> 94</span> <span class="keywordflow">if</span> (str[str_idx] &gt;= <span class="charliteral">&#39;A&#39;</span> &amp;&amp; str[str_idx] &lt;= <span class="charliteral">&#39;Z&#39;</span>) {</div>
<div class="line"><span class="lineno"> 95</span> ans = <span class="keyword">false</span>;</div>
<div class="line"><span class="lineno"> 96</span> } <span class="keywordflow">else</span> {</div>
<div class="line"><span class="lineno"> 97</span> ans = <a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">abbreviation_recursion</a>(memo, visited, str, result,</div>
<div class="line"><span class="lineno"> 98</span> str_idx + 1, result_idx);</div>
<div class="line"><span class="lineno"> 99</span> }</div>
<div class="line"><span class="lineno"> 100</span> }</div>
<div class="line"><span class="lineno"> 101</span> }</div>
<div class="line"><span class="lineno"> 102</span> (*memo)[str_idx][result_idx] = ans;</div>
<div class="line"><span class="lineno"> 103</span> (*visited)[str_idx][result_idx] = <span class="keyword">true</span>;</div>
<div class="line"><span class="lineno"> 104</span> <span class="keywordflow">return</span> (*memo)[str_idx][result_idx];</div>
<div class="line"><span class="lineno"> 105</span>}</div>
<div class="ttc" id="aabbreviation_8cpp_html_add60b8858720bf217df22d992d0fefaa"><div class="ttname"><a href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a></div><div class="ttdeci">bool abbreviation_recursion(std::vector&lt; std::vector&lt; bool &gt; &gt; *memo, std::vector&lt; std::vector&lt; bool &gt; &gt; *visited, const std::string &amp;str, const std::string &amp;result, uint32_t str_idx=0, uint32_t result_idx=0)</div><div class="ttdoc">Recursive Dynamic Programming function.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d73/abbreviation_8cpp_source.html#l00059">abbreviation.cpp:59</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="ae66f6b31b5ad750f1fe042a706a4e3d4" name="ae66f6b31b5ad750f1fe042a706a4e3d4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ae66f6b31b5ad750f1fe042a706a4e3d4">&#9670;&#160;</a></span>main()</h2>
<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">int main </td>
<td>(</td>
<td class="paramtype">void</td> <td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</div><div class="memdoc">
<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="../../d7/d73/abbreviation_8cpp_source.html#l00192">192</a> of file <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html">abbreviation.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 192</span> {</div>
<div class="line"><span class="lineno"> 193</span> <a class="code hl_function" href="#aa8dca7b867074164d5f45b0f3851269d">test</a>(); <span class="comment">// run self-test implementations</span></div>
<div class="line"><span class="lineno"> 194</span> <span class="keywordflow">return</span> 0;</div>
<div class="line"><span class="lineno"> 195</span>}</div>
<div class="ttc" id="aabbreviation_8cpp_html_aa8dca7b867074164d5f45b0f3851269d"><div class="ttname"><a href="#aa8dca7b867074164d5f45b0f3851269d">test</a></div><div class="ttdeci">static void test()</div><div class="ttdoc">Self test-implementations.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d73/abbreviation_8cpp_source.html#l00153">abbreviation.cpp:153</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a id="aa8dca7b867074164d5f45b0f3851269d" name="aa8dca7b867074164d5f45b0f3851269d"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa8dca7b867074164d5f45b0f3851269d">&#9670;&#160;</a></span>test()</h2>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
<tr>
<td class="mlabels-left">
<table class="memname">
<tr>
<td class="memname">void test </td>
<td>(</td>
<td class="paramname"><span class="paramname"><em></em></span></td><td>)</td>
<td></td>
</tr>
</table>
</td>
<td class="mlabels-right">
<span class="mlabels"><span class="mlabel static">static</span></span> </td>
</tr>
</table>
</div><div class="memdoc">
<p>Self test-implementations. </p>
<dl class="section return"><dt>Returns</dt><dd>void </dd></dl>
<p class="definition">Definition at line <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html#l00153">153</a> of file <a class="el" href="../../d7/d73/abbreviation_8cpp_source.html">abbreviation.cpp</a>.</p>
<div class="fragment"><div class="line"><span class="lineno"> 153</span> {</div>
<div class="line"><span class="lineno"> 154</span> std::string s = <span class="stringliteral">&quot;daBcd&quot;</span>, t = <span class="stringliteral">&quot;ABC&quot;</span>;</div>
<div class="line"><span class="lineno"> 155</span> std::vector&lt;std::vector&lt;bool&gt;&gt; memo(s.size() + 1,</div>
<div class="line"><span class="lineno"> 156</span> std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>)),</div>
<div class="line"><span class="lineno"> 157</span> visited(s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
<div class="line"><span class="lineno"> 158</span> </div>
<div class="line"><span class="lineno"> 159</span> assert(<a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a>(</div>
<div class="line"><span class="lineno"> 160</span> &amp;memo, &amp;visited, s, t) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 161</span> assert(<a class="code hl_function" href="#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a>(s, t) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 162</span> s = <span class="stringliteral">&quot;XXVVnDEFYgYeMXzWINQYHAQKKOZEYgSRCzLZAmUYGUGILjMDET&quot;</span>;</div>
<div class="line"><span class="lineno"> 163</span> t = <span class="stringliteral">&quot;XXVVDEFYYMXWINQYHAQKKOZEYSRCLZAUYGUGILMDETQVWU&quot;</span>;</div>
<div class="line"><span class="lineno"> 164</span> memo = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
<div class="line"><span class="lineno"> 165</span> s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
<div class="line"><span class="lineno"> 166</span> </div>
<div class="line"><span class="lineno"> 167</span> visited = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
<div class="line"><span class="lineno"> 168</span> s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
<div class="line"><span class="lineno"> 169</span> </div>
<div class="line"><span class="lineno"> 170</span> assert(<a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a>(</div>
<div class="line"><span class="lineno"> 171</span> &amp;memo, &amp;visited, s, t) == <span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 172</span> assert(<a class="code hl_function" href="#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a>(s, t) == <span class="keyword">false</span>);</div>
<div class="line"><span class="lineno"> 173</span> </div>
<div class="line"><span class="lineno"> 174</span> s = <span class="stringliteral">&quot;DRFNLZZVHLPZWIupjwdmqafmgkg&quot;</span>;</div>
<div class="line"><span class="lineno"> 175</span> t = <span class="stringliteral">&quot;DRFNLZZVHLPZWI&quot;</span>;</div>
<div class="line"><span class="lineno"> 176</span> </div>
<div class="line"><span class="lineno"> 177</span> memo = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
<div class="line"><span class="lineno"> 178</span> s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
<div class="line"><span class="lineno"> 179</span> </div>
<div class="line"><span class="lineno"> 180</span> visited = std::vector&lt;std::vector&lt;bool&gt;&gt;(</div>
<div class="line"><span class="lineno"> 181</span> s.size() + 1, std::vector&lt;bool&gt;(t.size() + 1, <span class="keyword">false</span>));</div>
<div class="line"><span class="lineno"> 182</span> </div>
<div class="line"><span class="lineno"> 183</span> assert(<a class="code hl_function" href="#add60b8858720bf217df22d992d0fefaa">dynamic_programming::abbreviation::abbreviation_recursion</a>(</div>
<div class="line"><span class="lineno"> 184</span> &amp;memo, &amp;visited, s, t) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 185</span> assert(<a class="code hl_function" href="#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a>(s, t) == <span class="keyword">true</span>);</div>
<div class="line"><span class="lineno"> 186</span>}</div>
<div class="ttc" id="aabbreviation_8cpp_html_af53b2f647bee9c5b75ef8dd9ef685dc8"><div class="ttname"><a href="#af53b2f647bee9c5b75ef8dd9ef685dc8">dynamic_programming::abbreviation::abbreviation</a></div><div class="ttdeci">bool abbreviation(const std::string &amp;str, const std::string &amp;result)</div><div class="ttdoc">Iterative Dynamic Programming function.</div><div class="ttdef"><b>Definition</b> <a href="../../d7/d73/abbreviation_8cpp_source.html#l00119">abbreviation.cpp:119</a></div></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="../../dir_8a20dd5bfd5341a725342bf72b6b686f.html">dynamic_programming</a></li><li class="navelem"><a href="../../d7/d73/abbreviation_8cpp.html">abbreviation.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.14.0 </li>
</ul>
</div>
</body>
</html>
Reference in New Issue View Git Blame Copy Permalink