Create README - LeetHub

hajin-kim · hajin-kim · commit 6d3fa925b303 · 2025-01-17T10:04:22.000+09:00
diff --git a/0540-single-element-in-a-sorted-array/README.md b/0540-single-element-in-a-sorted-array/README.md
@@ -0,0 +1,21 @@
+<h2><a href="https://leetcode.com/problems/single-element-in-a-sorted-array/">540. Single Element in a Sorted Array</a></h2><h3>Medium</h3><hr><p>You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once.</p>
+
+<p>Return <em>the single element that appears only once</em>.</p>
+
+<p>Your solution must run in <code>O(log n)</code> time and <code>O(1)</code> space.</p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+<pre><strong>Input:</strong> nums = [1,1,2,3,3,4,4,8,8]
+<strong>Output:</strong> 2
+</pre><p><strong class="example">Example 2:</strong></p>
+<pre><strong>Input:</strong> nums = [3,3,7,7,10,11,11]
+<strong>Output:</strong> 10
+</pre>
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>0 &lt;= nums[i] &lt;= 10<sup>5</sup></code></li>
+</ul>

-Original file line number
+Diff line change
@@ @@ -0,0 +1,21 @@ @@
 +<h2><a href="https://leetcode.com/problems/single-element-in-a-sorted-array/">540. Single Element in a Sorted Arraya>h2><h3>Mediumh3><hr><p>You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once.p>
++
 +<p>Return <em>the single element that appears only onceem>.p>
++
 +<p>Your solution must run in <code>O(log n)code> time and <code>O(1)code> space.p>
++
 +<p>&nbsp;p>
 +<p><strong class="example">Example 1:strong>p>
 +<pre><strong>Input:strong> nums = [1,1,2,3,3,4,4,8,8]
 +<strong>Output:strong> 2
 +pre><p><strong class="example">Example 2:strong>p>
 +<pre><strong>Input:strong> nums = [3,3,7,7,10,11,11]
 +<strong>Output:strong> 10
 +pre>
 +<p>&nbsp;p>
 +<p><strong>Constraints:strong>p>
++
 +<ul>
 +	1 <= nums.length <= 10⁵
 +	0 <= nums[i] <= 10⁵
 +ul>