一刷392

Author: diguage

README.adoc

@@ -2769,14 +2769,14 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|{doc_base_url}/0391-perfect-rectangle.adoc[题解]
 //|Hard
 //|
-//
-//|{counter:codes}
-//|{leetcode_base_url}/is-subsequence/[392. Is Subsequence^]
-//|{source_base_url}/_0392_IsSubsequence.java[Java]
-//|{doc_base_url}/0392-is-subsequence.adoc[题解]
-//|Easy
-//|
-//
+
+|{counter:codes}
+|{leetcode_base_url}/is-subsequence/[392. Is Subsequence^]
+|{source_base_url}/_0392_IsSubsequence.java[Java]
+|{doc_base_url}/0392-is-subsequence.adoc[题解]
+|Easy
+|
+
 //|{counter:codes}
 //|{leetcode_base_url}/utf-8-validation/[393. UTF-8 Validation^]
 //|{source_base_url}/_0393_UTF8Validation.java[Java]

docs/0392-is-subsequence.adoc

@@ -43,9 +43,33 @@ If there are lots of incoming S, say S1, S2, ... , Sk where k >= 1B, and you wan
 Special thanks to <a href="https://leetcode.com/pbrother/">@pbrother</a> for adding this problem and creating all test cases.
 
 
+== 思路分析
+
+双指针，当短指针到头也就是表明是子串。
+
 [[src-0392]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_0392_IsSubsequence.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_0392_IsSubsequence_2.java[tag=answer]
+// ----
+// --
+====
+
+== 参考资料
+
+. https://leetcode.cn/problems/is-subsequence/solutions/1658262/by-jyd-zeph/?envType=study-plan-v2&envId=selected-coding-interview[392. 判断子序列 - 双指针，清晰图解^]
 

docs/index.adoc

@@ -858,7 +858,7 @@ include::0387-first-unique-character-in-a-string.adoc[leveloffset=+1]
 
 // include::0391-perfect-rectangle.adoc[leveloffset=+1]
 
-// include::0392-is-subsequence.adoc[leveloffset=+1]
+include::0392-is-subsequence.adoc[leveloffset=+1]
 
 // include::0393-utf-8-validation.adoc[leveloffset=+1]
 

logbook/202406.adoc

@@ -797,6 +797,13 @@
 |{doc_base_url}/0169-majority-element.adoc[题解]
 |⭕️ 哈希计数法最易想到，摩尔投票法最妙！
 
+
+|{counter:codes}
+|{leetcode_base_url}/is-subsequence/[392. Is Subsequence^]
+|{doc_base_url}/0392-is-subsequence.adoc[题解]
+|✅ 双指针
+
+
 |===
 
 截止目前，本轮练习一共完成 {codes} 道题。

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

@@ -0,0 +1,26 @@
+package com.diguage.algo.leetcode;
+
+public class _0392_IsSubsequence {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2024-09-20 21:50:25
+   */
+  public boolean isSubsequence(String s, String t) {
+    if (s == null || s.length() == 0) {
+      return true;
+    }
+    int idx = 0;
+    for (int i = 0; i < t.length(); i++) {
+      if (idx >= s.length()){
+        break;
+      }
+      if (t.charAt(i) == s.charAt(idx)) {
+        idx++;
+      }
+    }
+    return idx >= s.length();
+  }
+  // end::answer[]
+}