一刷594

Author: diguage

README.adoc

@@ -4183,14 +4183,14 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|{doc_base_url}/0593-valid-square.adoc[题解]
 //|Medium
 //|
-//
-//|{counter:codes}
-//|{leetcode_base_url}/longest-harmonious-subsequence/[594. Longest Harmonious Subsequence^]
-//|{source_base_url}/_0594_LongestHarmoniousSubsequence.java[Java]
-//|{doc_base_url}/0594-longest-harmonious-subsequence.adoc[题解]
-//|Easy
-//|
-//
+
+|{counter:codes}
+|{leetcode_base_url}/longest-harmonious-subsequence/[594. Longest Harmonious Subsequence^]
+|{source_base_url}/_0594_LongestHarmoniousSubsequence.java[Java]
+|{doc_base_url}/0594-longest-harmonious-subsequence.adoc[题解]
+|Easy
+|
+
 //|{counter:codes}
 //|{leetcode_base_url}/big-countries/[595. Big Countries^]
 //|{source_base_url}/_0595_BigCountries.java[Java]

docs/0594-longest-harmonious-subsequence.adoc

@@ -1,30 +1,72 @@
 [#0594-longest-harmonious-subsequence]
-= 594. Longest Harmonious Subsequence
+= 594. 最长和谐子序列
 
-{leetcode}/problems/longest-harmonious-subsequence/[LeetCode - Longest Harmonious Subsequence^]
+https://leetcode.cn/problems/longest-harmonious-subsequence/[LeetCode - 594. 最长和谐子序列 ^]
 
-We define a harmounious array as an array where the difference between its maximum value and its minimum value is *exactly* 1.
+和谐数组是指一个数组里元素的最大值和最小值之间的差别 *正好是 `1`* 。
 
-Now, given an integer array, you need to find the length of its longest harmonious subsequence among all its possible <a href="https://en.wikipedia.org/wiki/Subsequence">subsequences</a>.
+现在，给你一个整数数组 `nums`，请你在所有可能的子序列中找到最长的和谐子序列的长度。
 
-*Example 1:*
+数组的子序列是一个由数组派生出来的序列，它可以通过删除一些元素或不删除元素、且不改变其余元素的顺序而得到。
 
-[subs="verbatim,quotes,macros"]
-----
-*Input:* [1,3,2,2,5,2,3,7]
-*Output:* 5
-*Explanation:* The longest harmonious subsequence is [3,2,2,2,3].
-----
+*示例 1：*
+
+....
+输入：nums = [1,3,2,2,5,2,3,7]
+输出：5
+解释：最长的和谐子序列是 [3,2,2,2,3]
+....
+
+*示例 2：*
+
+....
+输入：nums = [1,2,3,4]
+输出：2
+....
+
+*示例 3：*
 
- 
+....
+输入：nums = [1,1,1,1]
+输出：0
+....
 
-*Note:* The length of the input array will not exceed 20,000.
+*提示：*
 
+* `1 \<= nums.length \<= 2 * 10^4^`
+* `-10^9^ \<= nums[i] \<= 10^9^`
 
 
+== 思路分析
+
+最简单的解法是排序+滑动窗口！
+
+时间复杂度更优的解答是哈希计数。
+
 [[src-0594]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0594_LongestHarmoniousSubsequence.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_0594_LongestHarmoniousSubsequence_2.java[tag=answer]
+// ----
+// --
+====
+
+
+== 参考资料
 
+. https://leetcode.cn/problems/longest-harmonious-subsequence/solutions/1111541/gong-shui-san-xie-yi-ti-shuang-jie-hua-d-quuh/[594. 最长和谐子序列 - 一题双解 :「滑动窗口」&「哈希计数」^]
+. https://leetcode.cn/problems/longest-harmonious-subsequence/solutions/1110137/zui-chang-he-xie-zi-xu-lie-by-leetcode-s-8cyr/[594. 最长和谐子序列 - 官方题解^]

docs/index.adoc

@@ -1273,7 +1273,7 @@ include::0581-shortest-unsorted-continuous-subarray.adoc[leveloffset=+1]
 
 // include::0593-valid-square.adoc[leveloffset=+1]
 
-// include::0594-longest-harmonious-subsequence.adoc[leveloffset=+1]
+include::0594-longest-harmonious-subsequence.adoc[leveloffset=+1]
 
 // include::0595-big-countries.adoc[leveloffset=+1]
 

logbook/202503.adoc

@@ -1103,6 +1103,11 @@ endif::[]
 |{doc_base_url}/0214-shortest-palindrome.adoc[题解]
 |✅ 反转字符串，选择反转字符串结尾和原始字符串开头相同部分，再截取前缀+原始字符串即可获得答案！通过 124 / 126 个测试用例。使用 `reversed.substring(index)` 代替逐个字母比较，答案通过！
 
+|{counter:codes2503}
+|{leetcode_base_url}/longest-harmonious-subsequence/[594. 最长和谐子序列^]
+|{doc_base_url}/0594-longest-harmonious-subsequence.adoc[题解]
+|✅ 最简单的解法是排序。时间复杂度更优的解答是哈希计数。
+
 |===
 
 截止目前，本轮练习一共完成 {codes2503} 道题。

src/main/java/com/diguage/algo/leetcode/_0581_ShortestUnsortedContinuousSubarray.java

@@ -14,6 +14,9 @@ public class _0581_ShortestUnsortedContinuousSubarray {
     /**
      * Runtime: 4 ms, faster than 60.88% of Java online submissions for Shortest Unsorted Continuous Subarray.
      * Memory Usage: 51.8 MB, less than 7.69% of Java online submissions for Shortest Unsorted Continuous Subarray.
+     *
+     * @author D瓜哥 · https://www.diguage.com
+     * @since 2020-01-30 21:44
      */
     public int findUnsortedSubarray(int[] nums) {
         int min = Integer.MAX_VALUE;

src/main/java/com/diguage/algo/leetcode/_0594_LongestHarmoniousSubsequence.java

@@ -0,0 +1,26 @@
+package com.diguage.algo.leetcode;
+
+import java.util.HashMap;
+import java.util.Map;
+
+public class _0594_LongestHarmoniousSubsequence {
+  // tag::answer[]
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2020-01-30 21:44
+   */
+  public int findLHS(int[] nums) {
+    Map<Integer, Integer> map = new HashMap<>();
+    for (int num : nums) {
+      map.put(num, map.getOrDefault(num, 0) + 1);
+    }
+    int result = 0;
+    for (int num : nums) {
+      if (map.containsKey(num - 1)) {
+        result = Math.max(result, map.get(num - 1) + map.get(num));
+      }
+    }
+    return result;
+  }
+  // end::answer[]
+}