mirror of https://github.com/TheAlgorithms/C
Documentation for 21bd88215c
This commit is contained in:
parent
87ad62b846
commit
8d1548517f
|
@ -111,7 +111,7 @@ $(document).ready(function(){initNavTree('df/d58/md_leetcode__r_e_a_d_m_e.html',
|
|||
📝 Adding a new solution 📝</h1>
|
||||
<p >All LeetCode problems can be found <a href="https://leetcode.com/problemset/all/" target="_blank"><b>here</b></a>.\ If you have a solution to any of these problems (which are not being <a href="https://github.com/TheAlgorithms/C/blob/master/leetcode/DIRECTORY.md" target="_blank"><b>repeated</b></a>), that's great! Here are the steps:</p>
|
||||
<ol type="1">
|
||||
<li>Add a new file in <code>leetcode/src</code> with the number of the problem.\<ul>
|
||||
<li>Add a new file in <code>leetcode/src</code> with the number of the problem.<ul>
|
||||
<li>For example: if the problem's number is 98, the filename should be <code>98.c</code>.</li>
|
||||
</ul>
|
||||
</li>
|
||||
|
@ -131,9 +131,7 @@ $(document).ready(function(){initNavTree('df/d58/md_leetcode__r_e_a_d_m_e.html',
|
|||
📜 Adding your new solution to the list 📜</h2>
|
||||
<p >Great! You've added your solution. Now, you'll have to add it to <code>leetcode/DIRECTORY.md</code>.\ Please use numerical order. For example: if the solution's number is <code>98</code>, add your solution after <code>97</code>, if available.</p>
|
||||
<p >This is the required format for new solutinos:</p>
|
||||
<div class="fragment"><div class="line">...</div>
|
||||
<div class="line">| <solution number> | [<solution name>](<leetcode link to problem>) | [C](./src/<filename>.c) | <difficulty> |</div>
|
||||
<div class="line">...</div>
|
||||
<div class="fragment"><div class="line">| <solution number> | [<solution name>](<leetcode link to problem>) | [C](./src/<filename>.c) | <difficulty> |</div>
|
||||
</div><!-- fragment --><h1><a class="anchor" id="autotoc_md72"></a>
|
||||
📦 Committing your changes 📦</h1>
|
||||
<p >Once you're done with adding a new LeetCode solution, it's time we make a pull request.</p>
|
||||
|
|
Loading…
Reference in New Issue