Skip to content

Commit

Permalink
Auto commit
Browse files Browse the repository at this point in the history
  • Loading branch information
@github-actions
github-actions[bot] committed Aug 15, 2024
1 parent 012af6a commit 00e9272
Show file tree
Hide file tree
Showing 2,984 changed files with 208,341 additions and 208,067 deletions.
2,182 changes: 1,091 additions & 1,091 deletions annotated.html
View file

Large diffs are not rendered by default.

32 changes: 16 additions & 16 deletions classes.html
View file

Large diffs are not rendered by default.

71 changes: 39 additions & 32 deletions d0/d01/a00339.html
View file
Original file line number Diff line number Diff line change
Expand Up @@ -5,7 +5,7 @@
<meta http-equiv="X-UA-Compatible" content="IE=11"/>
<meta name="generator" content="Doxygen 1.9.2"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>problemscpp: leetcode::find_all_k_distant_indices_in_an_array 命名空间参考</title>
<title>problemscpp: leetcode::max_area_of_island 命名空间参考</title>
<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>
Expand Down Expand Up @@ -63,45 +63,47 @@

<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="../../d8/d72/a00199.html">leetcode</a></li><li class="navelem"><a class="el" href="../../d0/d01/a00339.html">find_all_k_distant_indices_in_an_array</a></li> </ul>
<li class="navelem"><a class="el" href="../../d3/db1/a00200.html">leetcode</a></li><li class="navelem"><a class="el" href="../../d0/d01/a00339.html">max_area_of_island</a></li> </ul>
</div>
</div><!-- top -->
<div class="header">
<div class="summary">
<a href="#nested-classes">类</a> &#124;
<a href="#func-members">函数</a> </div>
<div class="headertitle"><div class="title">leetcode::find_all_k_distant_indices_in_an_array 命名空间参考</div></div>
<div class="headertitle"><div class="title">leetcode::max_area_of_island 命名空间参考</div></div>
</div><!--header-->
<div class="contents">

<p>LeetCode 6031. 找出数组中的所有 K 近邻下标
<p>LeetCode 695. Max Area of Island
<a href="../../d0/d01/a00339.html#details">更多...</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="nested-classes" name="nested-classes"></a>
类</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/dd2/a02279.html">Solution</a></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d2/d81/a02276.html">Solution</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d5/dc0/a02272.html">UnionFind</a></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="func-members" name="func-members"></a>
函数</h2></td></tr>
<tr class="memitem:af50649cfc4c6f68def6f720709bf6374"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d01/a00339.html#af50649cfc4c6f68def6f720709bf6374">TEST</a> (find_all_k_distant_indices_in_an_array, case1)</td></tr>
<tr class="separator:af50649cfc4c6f68def6f720709bf6374"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ad2664108c5a4811948e18784a950d2aa"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d01/a00339.html#ad2664108c5a4811948e18784a950d2aa">TEST</a> (find_all_k_distant_indices_in_an_array, case2)</td></tr>
<tr class="separator:ad2664108c5a4811948e18784a950d2aa"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a48dc1953b07bdb14f5b3799542e2a3ee"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d01/a00339.html#a48dc1953b07bdb14f5b3799542e2a3ee">TEST</a> (max_area_of_island, case1)</td></tr>
<tr class="separator:a48dc1953b07bdb14f5b3799542e2a3ee"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6c02959a51ee63662551572fc91a909e"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="../../d0/d01/a00339.html#a6c02959a51ee63662551572fc91a909e">TEST</a> (max_area_of_island, case2)</td></tr>
<tr class="separator:a6c02959a51ee63662551572fc91a909e"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">详细描述</h2>
<div class="textblock"><p >LeetCode 6031. 找出数组中的所有 K 近邻下标 </p>
<div class="textblock"><p >LeetCode 695. Max Area of Island </p>
</div><h2 class="groupheader">函数说明</h2>
<a id="af50649cfc4c6f68def6f720709bf6374" name="af50649cfc4c6f68def6f720709bf6374"></a>
<h2 class="memtitle"><span class="permalink"><a href="#af50649cfc4c6f68def6f720709bf6374">&#9670;&nbsp;</a></span>TEST() <span class="overload">[1/2]</span></h2>
<a id="a48dc1953b07bdb14f5b3799542e2a3ee" name="a48dc1953b07bdb14f5b3799542e2a3ee"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a48dc1953b07bdb14f5b3799542e2a3ee">&#9670;&nbsp;</a></span>TEST() <span class="overload">[1/2]</span></h2>

<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">leetcode::find_all_k_distant_indices_in_an_array::TEST </td>
<td class="memname">leetcode::max_area_of_island::TEST </td>
<td>(</td>
<td class="paramtype">find_all_k_distant_indices_in_an_array&#160;</td>
<td class="paramtype">max_area_of_island&#160;</td>
<td class="paramname">, </td>
</tr>
<tr>
Expand All @@ -118,27 +120,33 @@ <h2 class="memtitle"><span class="permalink"><a href="#af50649cfc4c6f68def6f7207
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../dd/dad/a00005_source.html">leetcode_test.cpp</a> 第 <a class="el" href="../../dd/dad/a00005_source.html#l02178">2178</a> 行定义.</p>
<div class="fragment"><div class="line"><a id="l02178" name="l02178"></a><span class="lineno"> 2178</span> {</div>
<div class="line"><a id="l02179" name="l02179"></a><span class="lineno"> 2179</span> vector nums = {3, 4, 9, 1, 3, 9, 5};</div>
<div class="line"><a id="l02180" name="l02180"></a><span class="lineno"> 2180</span> <span class="keyword">const</span> vector output = {1, 2, 3, 4, 5, 6};</div>
<div class="line"><a id="l02181" name="l02181"></a><span class="lineno"> 2181</span> ASSERT_EQ(output, Solution::findKDistantIndices(nums, 9, 1));</div>
<div class="line"><a id="l02182" name="l02182"></a><span class="lineno"> 2182</span> }</div>
<p class="definition">在文件 <a class="el" href="../../dd/dad/a00005_source.html">leetcode_test.cpp</a> 第 <a class="el" href="../../dd/dad/a00005_source.html#l02159">2159</a> 行定义.</p>
<div class="fragment"><div class="line"><a id="l02159" name="l02159"></a><span class="lineno"> 2159</span> {</div>
<div class="line"><a id="l02160" name="l02160"></a><span class="lineno"> 2160</span> vector&lt;vector&lt;int&gt;&gt; input = {{0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0},</div>
<div class="line"><a id="l02161" name="l02161"></a><span class="lineno"> 2161</span> {0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0},</div>
<div class="line"><a id="l02162" name="l02162"></a><span class="lineno"> 2162</span> {0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0},</div>
<div class="line"><a id="l02163" name="l02163"></a><span class="lineno"> 2163</span> {0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0},</div>
<div class="line"><a id="l02164" name="l02164"></a><span class="lineno"> 2164</span> {0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0},</div>
<div class="line"><a id="l02165" name="l02165"></a><span class="lineno"> 2165</span> {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0},</div>
<div class="line"><a id="l02166" name="l02166"></a><span class="lineno"> 2166</span> {0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0},</div>
<div class="line"><a id="l02167" name="l02167"></a><span class="lineno"> 2167</span> {0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0}};</div>
<div class="line"><a id="l02168" name="l02168"></a><span class="lineno"> 2168</span> ASSERT_EQ(6, Solution::maxAreaOfIsland(input));</div>
<div class="line"><a id="l02169" name="l02169"></a><span class="lineno"> 2169</span> }</div>
</div><!-- fragment -->
<p class="reference">引用了 <a class="el" href="../../d9/d2e/a00056_source.html#l04315">leetcode::find_all_k_distant_indices_in_an_array::Solution::findKDistantIndices()</a>.</p>
<p class="reference">引用了 <a class="el" href="../../d9/d2e/a00056_source.html#l04227">leetcode::max_area_of_island::Solution::maxAreaOfIsland()</a>.</p>

</div>
</div>
<a id="ad2664108c5a4811948e18784a950d2aa" name="ad2664108c5a4811948e18784a950d2aa"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ad2664108c5a4811948e18784a950d2aa">&#9670;&nbsp;</a></span>TEST() <span class="overload">[2/2]</span></h2>
<a id="a6c02959a51ee63662551572fc91a909e" name="a6c02959a51ee63662551572fc91a909e"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a6c02959a51ee63662551572fc91a909e">&#9670;&nbsp;</a></span>TEST() <span class="overload">[2/2]</span></h2>

<div class="memitem">
<div class="memproto">
<table class="memname">
<tr>
<td class="memname">leetcode::find_all_k_distant_indices_in_an_array::TEST </td>
<td class="memname">leetcode::max_area_of_island::TEST </td>
<td>(</td>
<td class="paramtype">find_all_k_distant_indices_in_an_array&#160;</td>
<td class="paramtype">max_area_of_island&#160;</td>
<td class="paramname">, </td>
</tr>
<tr>
Expand All @@ -155,14 +163,13 @@ <h2 class="memtitle"><span class="permalink"><a href="#ad2664108c5a4811948e18784
</table>
</div><div class="memdoc">

<p class="definition">在文件 <a class="el" href="../../dd/dad/a00005_source.html">leetcode_test.cpp</a> 第 <a class="el" href="../../dd/dad/a00005_source.html#l02184">2184</a> 行定义.</p>
<div class="fragment"><div class="line"><a id="l02184" name="l02184"></a><span class="lineno"> 2184</span> {</div>
<div class="line"><a id="l02185" name="l02185"></a><span class="lineno"> 2185</span> vector nums = {2, 2, 2, 2, 2};</div>
<div class="line"><a id="l02186" name="l02186"></a><span class="lineno"> 2186</span> <span class="keyword">const</span> vector output = {0, 1, 2, 3, 4};</div>
<div class="line"><a id="l02187" name="l02187"></a><span class="lineno"> 2187</span> ASSERT_EQ(output, Solution::findKDistantIndices(nums, 2, 2));</div>
<div class="line"><a id="l02188" name="l02188"></a><span class="lineno"> 2188</span> }</div>
<p class="definition">在文件 <a class="el" href="../../dd/dad/a00005_source.html">leetcode_test.cpp</a> 第 <a class="el" href="../../dd/dad/a00005_source.html#l02171">2171</a> 行定义.</p>
<div class="fragment"><div class="line"><a id="l02171" name="l02171"></a><span class="lineno"> 2171</span> {</div>
<div class="line"><a id="l02172" name="l02172"></a><span class="lineno"> 2172</span> vector&lt;vector&lt;int&gt;&gt; input = {{0, 0, 0, 0, 0, 0, 0, 0}};</div>
<div class="line"><a id="l02173" name="l02173"></a><span class="lineno"> 2173</span> ASSERT_EQ(0, Solution::maxAreaOfIsland(input));</div>
<div class="line"><a id="l02174" name="l02174"></a><span class="lineno"> 2174</span> }</div>
</div><!-- fragment -->
<p class="reference">引用了 <a class="el" href="../../d9/d2e/a00056_source.html#l04315">leetcode::find_all_k_distant_indices_in_an_array::Solution::findKDistantIndices()</a>.</p>
<p class="reference">引用了 <a class="el" href="../../d9/d2e/a00056_source.html#l04227">leetcode::max_area_of_island::Solution::maxAreaOfIsland()</a>.</p>

</div>
</div>
Expand Down
140 changes: 0 additions & 140 deletions d0/d01/a02511.html
View file

This file was deleted.

Loading

0 comments on commit 00e9272

Please sign in to comment.