docs: update description to lc problem No.0035

No.0035.Search Insert Position

Author: YangFong

solution/0000-0099/0035.Search Insert Position/README.md

@@ -34,6 +34,23 @@
 <strong>输出:</strong> 0
 </pre>
 
+<p><strong>示例 5:</strong></p>
+
+<pre>
+<strong>输入:</strong> nums = [1], target = 0
+<strong>输出:</strong> 0
+</pre>
+<p> </p>
+
+<p><strong>提示:</strong></p>
+
+<ul>
+    <li><code>1 <= nums.length <= 10<sup>4</sup></code></li>
+    <li><code>-10<sup>4</sup> <= nums[i] <= 10<sup>4</sup></code></li>
+    <li><code>nums</code> 为<strong>无重复元素</strong>的<strong>升序</strong>排列数组</li>
+    <li><code>-10<sup>4</sup> <= target <= 10<sup>4</sup></code></li>
+</ul>
+
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->