add leetcode problem-cn part3

算法题（国内版）/problem (English)/最长和谐子序列(English) [longest-harmonious-subsequence].html

@@ -0,0 +1,36 @@
+<p>We define a harmonious array as an array where the difference between its maximum value and its minimum value is <b>exactly</b> <code>1</code>.</p>
+
+
+
+<p>Given an integer array <code>nums</code>, return <em>the length of its longest harmonious subsequence among all its possible subsequences</em>.</p>
+
+
+
+<p>A <strong>subsequence</strong> of array is a sequence that can be derived from the array by deleting some or no elements without changing the order of the remaining elements.</p>
+
+
+
+<p>&nbsp;</p>
+
+<p><strong>Example 1:</strong></p>
+
+
+
+<pre>
+
+<strong>Input:</strong> nums = [1,3,2,2,5,2,3,7]
+
+<strong>Output:</strong> 5
+
+<strong>Explanation:</strong> The longest harmonious subsequence is [3,2,2,2,3].
+
+</pre>
+
+
+
+<p><strong>Example 2:</strong></p>
+
+
+
+<pre>
+