add leetcode problem-cn part2

算法题（国内版）/problem (English)/消失的两个数字(English) [missing-two-lcci].html

@@ -0,0 +1,21 @@
+<p>You are given an array with all the numbers from 1 to N appearing exactly once, except for two number that is missing. How can you find the missing number in O(N) time and 0(1) space?</p>
+
+<p>You can return the missing numbers in any order.</p>
+
+<p><strong>Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> <code>[1]</code>
+<strong>Output: </strong>[2,3]</pre>
+
+<p><strong>Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> <code>[2,3]</code>
+<strong>Output: </strong>[1,4]</pre>
+
+<p><strong>Note: </strong></p>
+
+<ul>
+	<li><code>nums.length &lt;=&nbsp;30000</code></li>
+</ul>