一刷128

Author: diguage

README.adoc

@@ -922,12 +922,12 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 |Medium
 |
 
-//|{counter:codes}
-//|{leetcode_base_url}/longest-consecutive-sequence/[128. Longest Consecutive Sequence^]
-//|{source_base_url}/_0128_LongestConsecutiveSequence.java[Java]
-//|{doc_base_url}/0128-longest-consecutive-sequence.adoc[题解]
-//|Hard
-//|
+|{counter:codes}
+|{leetcode_base_url}/longest-consecutive-sequence/[128. Longest Consecutive Sequence^]
+|{source_base_url}/_0128_LongestConsecutiveSequence.java[Java]
+|{doc_base_url}/0128-longest-consecutive-sequence.adoc[题解]
+|Hard
+|
 
 |{counter:codes}
 |{leetcode_base_url}/sum-root-to-leaf-numbers/[129. Sum Root to Leaf Numbers^]

docs/0001-two-sum.adoc

@@ -33,9 +33,9 @@ https://leetcode.cn/problems/two-sum/[LeetCode - 1. 两数之和 ^]
 
 *提示：*
 
-* `+2 <= nums.length <= 10+`^`4`^
-* stem:[-10^9 <= "nums"[i\] <= 10^9]
-* stem:[-10^9 <= "target" <= 10^9]
+* `2 \<= nums.length \<= 10^4^`
+* `-10^9^ \<= nums[i] \<= 10^9^`
+* `-10^9^ \<= target <= 10^9^`
 * *只会存在一个有效答案*
 
 **进阶：**你可以想出一个时间复杂度小于 stem:[O(n^2)] 的算法吗？

docs/0033-search-in-rotated-sorted-array.adoc

@@ -38,7 +38,7 @@ https://leetcode.cn/problems/search-in-rotated-sorted-array/[LeetCode - 33. 搜
 *提示：*
 
 * `+1 <= nums.length <= 5000+`
-* `+-10+`^`+4+`^`+<= nums[i] <= 10+`^`+4+`^
+* `-10+`^`+4+`^`+<= nums[i] <= 10+`^`+4+`^
 * `+nums+` 中的每个值都 *独一无二*
 * 题目数据保证 `+nums+` 在预先未知的某个下标上进行了旋转
 * `+-10+`^`+4+`^`+<= target <= 10+`^`+4+`^

docs/0128-longest-consecutive-sequence.adoc

@@ -1,26 +1,67 @@
 [#0128-longest-consecutive-sequence]
-= 128. Longest Consecutive Sequence
+= 128. 最长连续序列
 
-{leetcode}/problems/longest-consecutive-sequence/[LeetCode - Longest Consecutive Sequence^]
+https://leetcode.cn/problems/longest-consecutive-sequence/[LeetCode - 128. 最长连续序列 ^]
 
-Given an unsorted array of integers, find the length of the longest consecutive elements sequence.
+给定一个未排序的整数数组 `nums`，找出数字连续的最长序列（不要求序列元素在原数组中连续）的长度。
 
-Your algorithm should run in O(_n_) complexity.
+请你设计并实现时间复杂度为 stem:[O(n)] 的算法解决此问题。
 
-*Example:*
+*示例 1：*
+
+....
+输入：nums = [100,4,200,1,3,2]
+输出：4
+解释：最长数字连续序列是 [1, 2, 3, 4]。它的长度为 4。
+....
+
+*示例 2：*
+
+....
+输入：nums = [0,3,7,2,5,8,4,6,0,1]
+输出：9
+....
+
+*提示：*
+
+* `0 \<= nums.length \<= 10^5^`
+* `-10^9^ \<= nums[i] \<= 10^9^`
 
-[subs="verbatim,quotes,macros"]
-----
-*Input:* [100, 4, 200, 1, 3, 2]
-*Output:* 4
-*Explanation:* The longest consecutive elements sequence is `[1, 2, 3, 4]`. Therefore its length is 4.
-----
 
+== 思路分析
 
+首先想到的思路是排序，然后再查找。
+
+答案的思路是：先将数字都添加到集合，然后遍历即可，只有没有前一位数字时，开始统计个数。
+
+看其他选手答案，使用并查集也可以解决。
 
 [[src-0128]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0128_LongestConsecutiveSequence.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_0128_LongestConsecutiveSequence_2.java[tag=answer]
+// ----
+// --
+====
+
+
+== 参考资料
+
+. https://leetcode.cn/problems/longest-consecutive-sequence/solutions/276931/zui-chang-lian-xu-xu-lie-by-leetcode-solution/[128. 最长连续序列 - 官方题解^]
+. https://leetcode.cn/problems/longest-consecutive-sequence/solutions/3652806/jian-yi-dai-ma-cbing-cha-ji-qiu-jie-by-w-b4hj/[128. 最长连续序列 - 简易代码——C++并查集求解^]
+. https://leetcode.cn/problems/longest-consecutive-sequence/solutions/3005726/ha-xi-biao-on-zuo-fa-pythonjavacgojsrust-whop/[128. 最长连续序列 - 哈希表 O(n) 做法^]
 

docs/index.adoc

@@ -338,7 +338,7 @@ include::0125-valid-palindrome.adoc[leveloffset=+1]
 
 include::0127-word-ladder.adoc[leveloffset=+1]
 
-// include::0128-longest-consecutive-sequence.adoc[leveloffset=+1]
+include::0128-longest-consecutive-sequence.adoc[leveloffset=+1]
 
 include::0129-sum-root-to-leaf-numbers.adoc[leveloffset=+1]
 

logbook/202503.adoc

@@ -423,6 +423,11 @@ endif::[]
 |{doc_base_url}/0721-accounts-merge.adoc[题解]
 |❌ 并查集。通过邮箱编号建立连接，而不是通过账户索引建立连接。
 
+|{counter:codes}
+|{leetcode_base_url}/longest-consecutive-sequence/[128. Longest Consecutive Sequence^]
+|{doc_base_url}/0128-longest-consecutive-sequence.adoc[题解]
+|⭕️ 最初思路是排序。看答案，可以构建集合，然后“起点”（没有前一个数字）数字开始统计。
+
 |===
 
 截止目前，本轮练习一共完成 {codes2503} 道题。

pom.xml

@@ -87,17 +87,39 @@
         </exclusion>
       </exclusions>
     </dependency>
+    <dependency>
+      <groupId>org.jruby</groupId>
+      <artifactId>jruby</artifactId>
+    </dependency>
+    <dependency>
+      <groupId>org.jruby</groupId>
+      <artifactId>jruby-complete</artifactId>
+    </dependency>
 
     <dependency>
       <groupId>com.fasterxml.jackson.core</groupId>
       <artifactId>jackson-databind</artifactId>
       <version>2.17.1</version>
     </dependency>
   </dependencies>
-
+  <dependencyManagement>
+    <dependencies>
+      <dependency>
+        <groupId>org.jruby</groupId>
+        <artifactId>jruby</artifactId>
+        <version>${jruby.version}</version>
+      </dependency>
+      <dependency>
+        <groupId>org.jruby</groupId>
+        <artifactId>jruby-complete</artifactId>
+        <version>${jruby.version}</version>
+      </dependency>
+    </dependencies>
+  </dependencyManagement>
   <build>
     <extensions>
       <extension> <!-- this allows us to download gems -->
+        <!-- 依赖了 jruby 9.4.5.0，也无法修改 -->
         <groupId>org.jruby.maven</groupId>
         <artifactId>mavengem-wagon</artifactId>
         <version>${mavengem-wagon.version}</version>
@@ -178,6 +200,7 @@
         </dependencies>
       </plugin>
       <plugin>
+        <!-- 依赖 jruby-complete	9.4.5.0，可以配置 jrubyVersion-->
         <groupId>org.jruby.maven</groupId>
         <artifactId>gem-maven-plugin</artifactId>
         <version>${gem-maven-plugin.version}</version>
@@ -437,6 +460,7 @@
         </executions>
       </plugin>
       <plugin>
+        <!-- 依赖 jruby	9.4.8.0/9.4.12.0 -->
         <groupId>org.asciidoctor</groupId>
         <artifactId>asciidoctor-maven-plugin</artifactId>
         <version>${asciidoctor-maven-plugin.version}</version>

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

@@ -58,6 +58,9 @@ public class _0127_WordLadder {
      * Memory Usage: 49.1 MB, less than 5.11% of Java online submissions for Word Ladder.
      *
      * Copy from: https://leetcode.com/problems/word-ladder/solution/[Word Ladder solution - LeetCode]
+     *
+     * @author D瓜哥 · https://www.diguage.com
+     * @since 2020-01-25 18:43
      */
     public int ladderLength(String beginWord, String endWord, List<String> wordList) {
         int L = beginWord.length();

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

@@ -54,6 +54,9 @@ public class _0127_WordLadder_2 {
   // tag::answer[]
   /**
    * 自己解答
+   *
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-06-30 21:46:35
    */
   public int ladderLength(String beginWord, String endWord, List<String> wordList) {
     Set<String> dic = new HashSet<>(wordList);

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

@@ -0,0 +1,33 @@
+package com.diguage.algo.leetcode;
+
+import java.util.HashSet;
+import java.util.Set;
+
+public class _0128_LongestConsecutiveSequence {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2025-04-22 14:32:50
+   */
+  public int longestConsecutive(int[] nums) {
+    Set<Integer> set = new HashSet<>(nums.length);
+    for (int num : nums) {
+      set.add(num);
+    }
+    int result = 0;
+    // 这里使用 set 遍历即可。使用 nums 超时
+    for (int num : set) {
+      int count = 1;
+      if (!set.contains(num - 1)) {
+        // 如果集合中包含目标数字，则遍历，否则就退出
+        for (int i = num + 1; set.contains(i); i++) {
+          count++;
+        }
+      }
+      result = Math.max(result, count);
+    }
+    return result;
+  }
+  // end::answer[]
+}