Create README - LeetHub

hajin-kim · hajin-kim · commit 17576591ee5f · 2024-12-29T10:21:08.000+09:00
diff --git a/0078-subsets/README.md b/0078-subsets/README.md
@@ -0,0 +1,27 @@
+<h2><a href="https://leetcode.com/problems/subsets/">78. Subsets</a></h2><h3>Medium</h3><hr><p>Given an integer array <code>nums</code> of <strong>unique</strong> elements, return <em>all possible</em> <span data-keyword="subset"><em>subsets</em></span> <em>(the power set)</em>.</p>
+
+<p>The solution set <strong>must not</strong> contain duplicate subsets. Return the solution in <strong>any order</strong>.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [1,2,3]
+<strong>Output:</strong> [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> nums = [0]
+<strong>Output:</strong> [[],[0]]
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 10</code></li>
+	<li><code>-10 &lt;= nums[i] &lt;= 10</code></li>
+	<li>All the numbers of&nbsp;<code>nums</code> are <strong>unique</strong>.</li>
+</ul>

-Original file line number
+Diff line change
@@ @@ -0,0 +1,27 @@ @@
 +<h2><a href="https://leetcode.com/problems/subsets/">78. Subsetsa>h2><h3>Mediumh3><hr><p>Given an integer array <code>numscode> of <strong>uniquestrong> elements, return <em>all possibleem> <span data-keyword="subset"><em>subsetsem>span> <em>(the power set)em>.p>
++
 +<p>The solution set <strong>must notstrong> contain duplicate subsets. Return the solution in <strong>any orderstrong>.p>
++
 +<p>&nbsp;p>
 +<p><strong class="example">Example 1:strong>p>
++
 +<pre>
 +<strong>Input:strong> nums = [1,2,3]
 +<strong>Output:strong> [[],[1],[2],[1,2],[3],[1,3],[2,3],[1,2,3]]
 +pre>
++
 +<p><strong class="example">Example 2:strong>p>
++
 +<pre>
 +<strong>Input:strong> nums = [0]
 +<strong>Output:strong> [[],[0]]
 +pre>
++
 +<p>&nbsp;p>
 +<p><strong>Constraints:strong>p>
++
 +<ul>
 +	1 <= nums.length <= 10
 +	-10 <= nums[i] <= 10
 +	All the numbers of nums are unique.
 +ul>