OpenSoure_Repos/TheAlgorithms-C
1
0
Fork 0
mirror of https://github.moeyy.xyz/https://github.com/TheAlgorithms/C.git synced 2023-10-11 15:56:24 +08:00
Code Issues Packages Projects Releases Wiki Activity

Documentation for 9fa578d4b5

Browse Source
This commit is contained in:
github-actions 2023-02-03 02:00:45 +00:00
parent 9adef4a891
commit d8cb3f4f86
5 changed files with 32 additions and 30 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

50
d6/d77/md_leetcode__d_i_r_e_c_t_o_r_y.html
View File

@ -334,54 +334,56 @@ LeetCode Algorithm</h2>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1089 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/duplicate-zeros" target="_blank">Duplicate Zeros</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1089.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1137 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/n-th-tribonacci-number" target="_blank">N-th Tribonacci Number</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1137.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1147 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/longest-chunked-palindrome-decomposition" target="_blank">Longest Chunked Palindrome Decomposition</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1147.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Hard </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1184 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/distance-between-bus-stops" target="_blank">Distance Between Bus Stops</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1184.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1189 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximum-number-of-balloons" target="_blank">Maximum Number of Balloons</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1189.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1207 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/unique-number-of-occurrences" target="_blank">Unique Number of Occurrences</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1207.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1283 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold" target="_blank">Find the Smallest Divisor Given a Threshold</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1283.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1524 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum" target="_blank">Number of Sub-arrays With Odd Sum</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1524.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1653 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/minimum-deletions-to-make-string-balanced" target="_blank">Minimum Deletions to Make String Balanced</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1653.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1657 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/determine-if-two-strings-are-close" target="_blank">Determine if Two Strings Are Close</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1657.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1695 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximum-erasure-value" target="_blank">Maximum Erasure Value</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1695.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1704 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/determine-if-string-halves-are-alike" target="_blank">Determine if String Halves Are Alike</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1704.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1752 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/check-if-array-is-sorted-and-rotated" target="_blank">Check if Array Is Sorted and Rotated</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1752.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Easy </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1769 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box" target="_blank">Minimum Number of Operations to Move All Balls to Each Box</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1769.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">1833 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximum-ice-cream-bars" target="_blank">Maximum Ice Cream Bars</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1833.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">1838 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/frequency-of-the-most-frequent-element" target="_blank">Frequency of the Most Frequent Element</a> </td><td class="markdownTableBodyNone"><a href="../.././src/1838.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">2024 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximize-the-confusion-of-an-exam" target="_blank">Maximize the Confusion of an Exam</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2024.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">2095 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list" target="_blank">Delete the Middle Node of a Linked List</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2095.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">2125 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/number-of-laser-beams-in-a-bank" target="_blank">Number of Laser Beams in a Bank</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2125.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">2130 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list" target="_blank">Maximum Twin Sum of a Linked List</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2130.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">2222 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/number-of-ways-to-select-buildings" target="_blank">Number of Ways to Select Buildings</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2222.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">2256 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/minimum-average-difference" target="_blank">Minimum Average Difference</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2256.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">2270 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/number-of-ways-to-split-array" target="_blank">Number of Ways to Split Array</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2270.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">2279 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/maximum-bags-with-full-capacity-of-rocks" target="_blank">Maximum Bags With Full Capacity of Rocks</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2279.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">2304 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/minimum-path-cost-in-a-grid" target="_blank">Minimum Path Cost in a Grid</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2304.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">2482 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/difference-between-ones-and-zeros-in-row-and-column" target="_blank">Difference Between Ones and Zeros in Row and Column</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2482.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<td class="markdownTableBodyNone">2304 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/minimum-path-cost-in-a-grid" target="_blank">Minimum Path Cost in a Grid</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2304.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowOdd">
<td class="markdownTableBodyNone">2482 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/difference-between-ones-and-zeros-in-row-and-column" target="_blank">Difference Between Ones and Zeros in Row and Column</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2482.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
<tr class="markdownTableRowEven">
<td class="markdownTableBodyNone">2501 </td><td class="markdownTableBodyNone"><a href="https://leetcode.com/problems/longest-square-streak-in-an-array" target="_blank">Longest Square Streak in an Array</a> </td><td class="markdownTableBodyNone"><a href="../.././src/2501.c" target="_blank">C</a> </td><td class="markdownTableBodyNone">Medium </td></tr>
</table>
</div></div><!-- contents -->

2
globals_func_i.html
View File

@ -119,8 +119,8 @@ $(document).ready(function(){initNavTree('globals_func_i.html',''); initResizabl
<li>isEmpty()&#160;:&#160;<a class="el" href="db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021">infix_to_postfix.c</a>, <a class="el" href="da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e">infix_to_postfix2.c</a></li>
<li>isOprnd()&#160;:&#160;<a class="el" href="db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b">infix_to_postfix.c</a></li>
<li>isPalindrome()&#160;:&#160;<a class="el" href="df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba">palindrome.c</a></li>
<li>isPrime()&#160;:&#160;<a class="el" href="da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f">prime.c</a></li>
<li>isprime()&#160;:&#160;<a class="el" href="d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305">sol1.c</a></li>
<li>isPrime()&#160;:&#160;<a class="el" href="da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f">prime.c</a></li>
<li>isStrong()&#160;:&#160;<a class="el" href="d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5">strong_number.c</a></li>
</ul>
</div><!-- contents -->

2
globals_i.html
View File

@ -120,8 +120,8 @@ $(document).ready(function(){initNavTree('globals_i.html',''); initResizable();
<li>isEmpty()&#160;:&#160;<a class="el" href="db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021">infix_to_postfix.c</a>, <a class="el" href="da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e">infix_to_postfix2.c</a></li>
<li>isOprnd()&#160;:&#160;<a class="el" href="db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b">infix_to_postfix.c</a></li>
<li>isPalindrome()&#160;:&#160;<a class="el" href="df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba">palindrome.c</a></li>
<li>isPrime()&#160;:&#160;<a class="el" href="da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f">prime.c</a></li>
<li>isprime()&#160;:&#160;<a class="el" href="d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305">sol1.c</a></li>
<li>isPrime()&#160;:&#160;<a class="el" href="da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f">prime.c</a></li>
<li>isStrong()&#160;:&#160;<a class="el" href="d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5">strong_number.c</a></li>
</ul>
</div><!-- contents -->

4
search/all_b.js
View File

@ -27,7 +27,7 @@ var searchData=
['isempty_24',['isEmpty',['../db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021',1,'isEmpty(struct Stack s):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e',1,'isEmpty():&#160;infix_to_postfix2.c']]],
['isoprnd_25',['isOprnd',['../db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b',1,'infix_to_postfix.c']]],
['ispalindrome_26',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]],
['isprime_27',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
['isprime_28',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
['isprime_27',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
['isprime_28',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
['isstrong_29',['isStrong',['../d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5',1,'strong_number.c']]]
];

4
search/functions_9.js
View File

@ -19,7 +19,7 @@ var searchData=
['isempty_16',['isEmpty',['../db/d0c/infix__to__postfix_8c.html#afa8471c76bc57b12ad21de22beb39021',1,'isEmpty(struct Stack s):&#160;infix_to_postfix.c'],['../da/d96/infix__to__postfix2_8c.html#a653c98c68c558505b75b04c44b7c838e',1,'isEmpty():&#160;infix_to_postfix2.c']]],
['isoprnd_17',['isOprnd',['../db/d0c/infix__to__postfix_8c.html#afd8245c04b202240390de23170f72d6b',1,'infix_to_postfix.c']]],
['ispalindrome_18',['isPalindrome',['../df/d16/palindrome_8c.html#a6320493ddee0ca4614423721c5d6f4ba',1,'palindrome.c']]],
['isprime_19',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
['isprime_20',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
['isprime_19',['isprime',['../d7/dd3/problem__3_2sol1_8c.html#aa0f4796aa2e89c327f827bd55f5cb305',1,'sol1.c']]],
['isprime_20',['isPrime',['../da/d93/prime_8c.html#a6384596f117decd77da25af95ab1704f',1,'prime.c']]],
['isstrong_21',['isStrong',['../d4/dcc/strong__number_8c.html#a03654cadb0cfe1195810dbe5da0265b5',1,'strong_number.c']]]
];