一刷1047

Author: diguage

README.adoc

@@ -7354,14 +7354,14 @@ TIP: **公众号的微信号是: `jikerizhi`**。__因为众所周知的原因
 //|{doc_base_url}/1046-last-stone-weight.adoc[题解]
 //|Easy
 //|
-//
-//|{counter:codes}
-//|{leetcode_base_url}/remove-all-adjacent-duplicates-in-string/[1047. Remove All Adjacent Duplicates In String^]
-//|{source_base_url}/_1047_RemoveAllAdjacentDuplicatesInString.java[Java]
-//|{doc_base_url}/1047-remove-all-adjacent-duplicates-in-string.adoc[题解]
-//|Easy
-//|
-//
+
+|{counter:codes}
+|{leetcode_base_url}/remove-all-adjacent-duplicates-in-string/[1047. Remove All Adjacent Duplicates In String^]
+|{source_base_url}/_1047_RemoveAllAdjacentDuplicatesInString.java[Java]
+|{doc_base_url}/1047-remove-all-adjacent-duplicates-in-string.adoc[题解]
+|Easy
+|
+
 //|{counter:codes}
 //|{leetcode_base_url}/longest-string-chain/[1048. Longest String Chain^]
 //|{source_base_url}/_1048_LongestStringChain.java[Java]

docs/1047-remove-all-adjacent-duplicates-in-string.adoc

@@ -1,39 +1,56 @@
 [#1047-remove-all-adjacent-duplicates-in-string]
-= 1047. Remove All Adjacent Duplicates In String
+= 1047. 删除字符串中的所有相邻重复项
 
-{leetcode}/problems/remove-all-adjacent-duplicates-in-string/[LeetCode - Remove All Adjacent Duplicates In String^]
+https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string/[LeetCode - 1047. 删除字符串中的所有相邻重复项 ^]
 
-Given a string `S` of lowercase letters, a _duplicate removal_ consists of choosing two adjacent and equal letters, and removing them.
+给出由小写字母组成的字符串 `s`，**重复项删除操作**会选择两个相邻且相同的字母，并删除它们。
 
-We repeatedly make duplicate removals on S until we no longer can.
+在 `s` 上反复执行重复项删除操作，直到无法继续删除。
 
-Return the final string after all such duplicate removals have been made.  It is guaranteed the answer is unique.
+在完成所有重复项删除操作后返回最终的字符串。答案保证唯一。
 
- 
+*示例：*
 
-*Example 1:*
+....
+输入："abbaca"
+输出："ca"
+解释：
+例如，在 "abbaca" 中，我们可以删除 "bb" 由于两字母相邻且相同，这是此时唯一可以执行删除操作的重复项。之后我们得到字符串 "aaca"，其中又只有 "aa" 可以执行重复项删除操作，所以最后的字符串为 "ca"。
+....
 
-[subs="verbatim,quotes,macros"]
-----
-*Input:* "abbaca"
-*Output:* "ca"
-*Explanation:*
-For example, in "abbaca" we could remove "bb" since the letters are adjacent and equal, and this is the only possible move.  The result of this move is that the string is "aaca", of which only "aa" is possible, so the final string is "ca".
-----
-
- 
-
-*Note:*
+*提示：*
 
+. `1 \<= s.length \<= 10^5^`
+. `s` 仅由小写英文字母组成。
 
-. `1 <= S.length <= 20000`
-. `S` consists only of English lowercase letters.
 
+== 思路分析
 
+把 `StringBuilder` 当做栈来使用。将最后一个字符与当前字符比较，相等则删除最后一个字符，否则就添加。
 
 [[src-1047]]
+[tabs]
+====
+一刷::
++
+--
 [{java_src_attr}]
 ----
 include::{sourcedir}/_1047_RemoveAllAdjacentDuplicatesInString.java[tag=answer]
 ----
+--
+
+// 二刷::
+// +
+// --
+// [{java_src_attr}]
+// ----
+// include::{sourcedir}/_1047_RemoveAllAdjacentDuplicatesInString_2.java[tag=answer]
+// ----
+// --
+====
+
+
+== 参考资料
 
+. https://leetcode.cn/problems/remove-all-adjacent-duplicates-in-string/solutions/643955/shan-chu-zi-fu-chuan-zhong-de-suo-you-xi-4ohr/[1047. 删除字符串中的所有相邻重复项 - 官方题解^]

docs/index.adoc

@@ -2176,7 +2176,7 @@ include::1041-robot-bounded-in-circle.adoc[leveloffset=+1]
 
 // include::1046-last-stone-weight.adoc[leveloffset=+1]
 
-// include::1047-remove-all-adjacent-duplicates-in-string.adoc[leveloffset=+1]
+include::1047-remove-all-adjacent-duplicates-in-string.adoc[leveloffset=+1]
 
 // include::1048-longest-string-chain.adoc[leveloffset=+1]
 

logbook/202503.adoc

@@ -473,6 +473,11 @@ endif::[]
 |{doc_base_url}/0084-largest-rectangle-in-histogram.adoc[题解]
 |❌ 单调栈。一脸懵逼。哨兵技巧非常巧妙。
 
+|{counter:codes2503}
+|{leetcode_base_url}/remove-all-adjacent-duplicates-in-string/[1047. 删除字符串中的所有相邻重复项^]
+|{doc_base_url}/1047-remove-all-adjacent-duplicates-in-string.adoc[题解]
+|⭕️ 栈。把 `StringBuilder` 当做栈来使用。将最后一个字符与当前字符比较，相等则删除最后一个字符，否则就添加。
+
 
 |===
 

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

@@ -0,0 +1,43 @@
+package com.diguage.algo.leetcode;
+
+public class _1047_RemoveAllAdjacentDuplicatesInString {
+  // tag::answer[]
+
+  /**
+   * @author D瓜哥 · https://www.diguage.com
+   * @since 2025-04-23 21:41:43
+   */
+  public String removeDuplicates(String s) {
+    // 使用 SB 当做栈，逐步推进
+    //    StringBuilder stack = new StringBuilder();
+    //    int top = -1;
+    //    for (int i = 0; i < s.length(); i++) {
+    //      char c = s.charAt(i);
+    //      if (top >= 0 && stack.charAt(top) == c) {
+    //        stack.deleteCharAt(top);
+    //        top--;
+    //      } else {
+    //        stack.append(c);
+    //        top++;
+    //      }
+    //    }
+    //    return stack.toString();
+    // 同样的思路，直接在数组上操作。
+    char[] chars = s.toCharArray();
+    int top = -1;
+    for (int i = 0; i < chars.length; i++) {
+      if (top == -1 || chars[top] != chars[i]) {
+        chars[++top] = chars[i];
+      } else {
+        top--;
+      }
+    }
+    return new String(chars, 0, top + 1);
+  }
+
+  // end::answer[]
+  public static void main(String[] args) {
+    new _1047_RemoveAllAdjacentDuplicatesInString()
+      .removeDuplicates("abbbaca");
+  }
+}