diff --git a/docs/notes/Leetcode 题解 - 双指针.md b/docs/notes/Leetcode 题解 - 双指针.md index 471cc0bd..6488aa95 100644 --- a/docs/notes/Leetcode 题解 - 双指针.md +++ b/docs/notes/Leetcode 题解 - 双指针.md @@ -111,7 +111,7 @@ Given s = "leetcode", return "leotcede". - 时间复杂度为 O(N)：只需要遍历所有元素一次 - 空间复杂度 O(1)：只需要使用两个额外变量 -

+

```java private final static HashSet vowels = new HashSet<>( diff --git a/docs/pics/ef25ff7c-0f63-420d-8b30-eafbeea35d11.gif b/docs/pics/ef25ff7c-0f63-420d-8b30-eafbeea35d11.gif new file mode 100644 index 00000000..ee7c43a1 Binary files /dev/null and b/docs/pics/ef25ff7c-0f63-420d-8b30-eafbeea35d11.gif differ diff --git a/notes/Leetcode 题解 - 双指针.md b/notes/Leetcode 题解 - 双指针.md index 2b433bc4..aa08f977 100644 --- a/notes/Leetcode 题解 - 双指针.md +++ b/notes/Leetcode 题解 - 双指针.md @@ -111,7 +111,7 @@ Given s = "leetcode", return "leotcede". - 时间复杂度为 O(N)：只需要遍历所有元素一次 - 空间复杂度 O(1)：只需要使用两个额外变量 -

+

```java private final static HashSet vowels = new HashSet<>( diff --git a/notes/pics/ef25ff7c-0f63-420d-8b30-eafbeea35d11.gif b/notes/pics/ef25ff7c-0f63-420d-8b30-eafbeea35d11.gif new file mode 100644 index 00000000..ee7c43a1 Binary files /dev/null and b/notes/pics/ef25ff7c-0f63-420d-8b30-eafbeea35d11.gif differ