doocs · acbin · Feb 21, 2024 · Feb 20, 2024 · Feb 20, 2024
diff --git a/solution/0000-0099/0001.Two Sum/README.md b/solution/0000-0099/0001.Two Sum/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0001.Two%20Sum/README_EN.md)
 
+<!-- tags:数组,哈希表 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0001.Two Sum/README_EN.md b/solution/0000-0099/0001.Two Sum/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0001.Two%20Sum/README.md)
 
+<!-- tags:Array,Hash Table -->
+
 ## Description
 
 <p>Given an array of integers <code>nums</code>&nbsp;and an integer <code>target</code>, return <em>indices of the two numbers such that they add up to <code>target</code></em>.</p>

diff --git a/solution/0000-0099/0002.Add Two Numbers/README.md b/solution/0000-0099/0002.Add Two Numbers/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0002.Add%20Two%20Numbers/README_EN.md)
 
+<!-- tags:递归,链表,数学 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0002.Add Two Numbers/README_EN.md b/solution/0000-0099/0002.Add Two Numbers/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0002.Add%20Two%20Numbers/README.md)
 
+<!-- tags:Recursion,Linked List,Math -->
+
 ## Description
 
 <p>You are given two <strong>non-empty</strong> linked lists representing two non-negative integers. The digits are stored in <strong>reverse order</strong>, and each of their nodes contains a single digit. Add the two numbers and return the sum&nbsp;as a linked list.</p>

diff --git a/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md b/solution/0000-0099/0003.Longest Substring Without Repeating Characters/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README_EN.md)
 
+<!-- tags:哈希表,字符串,滑动窗口 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/...tion/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md b/...tion/0000-0099/0003.Longest Substring Without Repeating Characters/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0003.Longest%20Substring%20Without%20Repeating%20Characters/README.md)
 
+<!-- tags:Hash Table,String,Sliding Window -->
+
 ## Description
 
 <p>Given a string <code>s</code>, find the length of the <strong>longest</strong> <span data-keyword="substring-nonempty"><strong>substring</strong></span> without repeating characters.</p>

diff --git a/solution/0000-0099/0004.Median of Two Sorted Arrays/README.md b/solution/0000-0099/0004.Median of Two Sorted Arrays/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README_EN.md)
 
+<!-- tags:数组,二分查找,分治 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0004.Median of Two Sorted Arrays/README_EN.md b/solution/0000-0099/0004.Median of Two Sorted Arrays/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0004.Median%20of%20Two%20Sorted%20Arrays/README.md)
 
+<!-- tags:Array,Binary Search,Divide and Conquer -->
+
 ## Description
 
 <p>Given two sorted arrays <code>nums1</code> and <code>nums2</code> of size <code>m</code> and <code>n</code> respectively, return <strong>the median</strong> of the two sorted arrays.</p>

diff --git a/solution/0000-0099/0005.Longest Palindromic Substring/README.md b/solution/0000-0099/0005.Longest Palindromic Substring/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README_EN.md)
 
+<!-- tags:字符串,动态规划 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0005.Longest Palindromic Substring/README_EN.md b/solution/0000-0099/0005.Longest Palindromic Substring/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0005.Longest%20Palindromic%20Substring/README.md)
 
+<!-- tags:String,Dynamic Programming -->
+
 ## Description
 
 <p>Given a string <code>s</code>, return <em>the longest</em> <span data-keyword="palindromic-string"><em>palindromic</em></span> <span data-keyword="substring-nonempty"><em>substring</em></span> in <code>s</code>.</p>

diff --git a/solution/0000-0099/0006.Zigzag Conversion/README.md b/solution/0000-0099/0006.Zigzag Conversion/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0006.Zigzag%20Conversion/README_EN.md)
 
+<!-- tags:字符串 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0006.Zigzag Conversion/README_EN.md b/solution/0000-0099/0006.Zigzag Conversion/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0006.Zigzag%20Conversion/README.md)
 
+<!-- tags:String -->
+
 ## Description
 
 <p>The string <code>&quot;PAYPALISHIRING&quot;</code> is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)</p>

diff --git a/solution/0000-0099/0007.Reverse Integer/README.md b/solution/0000-0099/0007.Reverse Integer/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0007.Reverse%20Integer/README_EN.md)
 
+<!-- tags:数学 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0007.Reverse Integer/README_EN.md b/solution/0000-0099/0007.Reverse Integer/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0007.Reverse%20Integer/README.md)
 
+<!-- tags:Math -->
+
 ## Description
 
 <p>Given a signed 32-bit integer <code>x</code>, return <code>x</code><em> with its digits reversed</em>. If reversing <code>x</code> causes the value to go outside the signed 32-bit integer range <code>[-2<sup>31</sup>, 2<sup>31</sup> - 1]</code>, then return <code>0</code>.</p>

diff --git a/solution/0000-0099/0008.String to Integer (atoi)/README.md b/solution/0000-0099/0008.String to Integer (atoi)/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README_EN.md)
 
+<!-- tags:字符串 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0008.String to Integer (atoi)/README_EN.md b/solution/0000-0099/0008.String to Integer (atoi)/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README.md)
 
+<!-- tags:String -->
+
 ## Description
 
 <p>Implement the <code>myAtoi(string s)</code> function, which converts a string to a 32-bit signed integer (similar to C/C++&#39;s <code>atoi</code> function).</p>

diff --git a/solution/0000-0099/0009.Palindrome Number/README.md b/solution/0000-0099/0009.Palindrome Number/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0009.Palindrome%20Number/README_EN.md)
 
+<!-- tags:数学 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0009.Palindrome Number/README_EN.md b/solution/0000-0099/0009.Palindrome Number/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0009.Palindrome%20Number/README.md)
 
+<!-- tags:Math -->
+
 ## Description
 
 <p>Given an integer <code>x</code>, return <code>true</code><em> if </em><code>x</code><em> is a </em><span data-keyword="palindrome-integer"><em><strong>palindrome</strong></em></span><em>, and </em><code>false</code><em> otherwise</em>.</p>

diff --git a/solution/0000-0099/0010.Regular Expression Matching/README.md b/solution/0000-0099/0010.Regular Expression Matching/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0010.Regular%20Expression%20Matching/README_EN.md)
 
+<!-- tags:递归,字符串,动态规划 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0010.Regular Expression Matching/README_EN.md b/solution/0000-0099/0010.Regular Expression Matching/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0010.Regular%20Expression%20Matching/README.md)
 
+<!-- tags:Recursion,String,Dynamic Programming -->
+
 ## Description
 
 <p>Given an input string <code>s</code>&nbsp;and a pattern <code>p</code>, implement regular expression matching with support for <code>&#39;.&#39;</code> and <code>&#39;*&#39;</code> where:</p>

diff --git a/solution/0000-0099/0011.Container With Most Water/README.md b/solution/0000-0099/0011.Container With Most Water/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0011.Container%20With%20Most%20Water/README_EN.md)
 
+<!-- tags:贪心,数组,双指针 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0011.Container With Most Water/README_EN.md b/solution/0000-0099/0011.Container With Most Water/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0011.Container%20With%20Most%20Water/README.md)
 
+<!-- tags:Greedy,Array,Two Pointers -->
+
 ## Description
 
 <p>You are given an integer array <code>height</code> of length <code>n</code>. There are <code>n</code> vertical lines drawn such that the two endpoints of the <code>i<sup>th</sup></code> line are <code>(i, 0)</code> and <code>(i, height[i])</code>.</p>

diff --git a/solution/0000-0099/0012.Integer to Roman/README.md b/solution/0000-0099/0012.Integer to Roman/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0012.Integer%20to%20Roman/README_EN.md)
 
+<!-- tags:哈希表,数学,字符串 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0012.Integer to Roman/README_EN.md b/solution/0000-0099/0012.Integer to Roman/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0012.Integer%20to%20Roman/README.md)
 
+<!-- tags:Hash Table,Math,String -->
+
 ## Description
 
 <p>Roman numerals are represented by seven different symbols:&nbsp;<code>I</code>, <code>V</code>, <code>X</code>, <code>L</code>, <code>C</code>, <code>D</code> and <code>M</code>.</p>

diff --git a/solution/0000-0099/0013.Roman to Integer/README.md b/solution/0000-0099/0013.Roman to Integer/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0013.Roman%20to%20Integer/README_EN.md)
 
+<!-- tags:哈希表,数学,字符串 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0013.Roman to Integer/README_EN.md b/solution/0000-0099/0013.Roman to Integer/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0013.Roman%20to%20Integer/README.md)
 
+<!-- tags:Hash Table,Math,String -->
+
 ## Description
 
 <p>Roman numerals are represented by seven different symbols:&nbsp;<code>I</code>, <code>V</code>, <code>X</code>, <code>L</code>, <code>C</code>, <code>D</code> and <code>M</code>.</p>

diff --git a/solution/0000-0099/0014.Longest Common Prefix/README.md b/solution/0000-0099/0014.Longest Common Prefix/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0014.Longest%20Common%20Prefix/README_EN.md)
 
+<!-- tags:字典树,字符串 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0014.Longest Common Prefix/README_EN.md b/solution/0000-0099/0014.Longest Common Prefix/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0014.Longest%20Common%20Prefix/README.md)
 
+<!-- tags:Trie,String -->
+
 ## Description
 
 <p>Write a function to find the longest common prefix string amongst an array of strings.</p>

diff --git a/solution/0000-0099/0015.3Sum/README.md b/solution/0000-0099/0015.3Sum/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0015.3Sum/README_EN.md)
 
+<!-- tags:数组,双指针,排序 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0015.3Sum/README_EN.md b/solution/0000-0099/0015.3Sum/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0015.3Sum/README.md)
 
+<!-- tags:Array,Two Pointers,Sorting -->
+
 ## Description
 
 <p>Given an integer array nums, return all the triplets <code>[nums[i], nums[j], nums[k]]</code> such that <code>i != j</code>, <code>i != k</code>, and <code>j != k</code>, and <code>nums[i] + nums[j] + nums[k] == 0</code>.</p>

diff --git a/solution/0000-0099/0016.3Sum Closest/README.md b/solution/0000-0099/0016.3Sum Closest/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0016.3Sum%20Closest/README_EN.md)
 
+<!-- tags:数组,双指针,排序 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0016.3Sum Closest/README_EN.md b/solution/0000-0099/0016.3Sum Closest/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0016.3Sum%20Closest/README.md)
 
+<!-- tags:Array,Two Pointers,Sorting -->
+
 ## Description
 
 <p>Given an integer array <code>nums</code> of length <code>n</code> and an integer <code>target</code>, find three integers in <code>nums</code> such that the sum is closest to <code>target</code>.</p>

diff --git a/solution/0000-0099/0017.Letter Combinations of a Phone Number/README.md b/solution/0000-0099/0017.Letter Combinations of a Phone Number/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/README_EN.md)
 
+<!-- tags:哈希表,字符串,回溯 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0017.Letter Combinations of a Phone Number/README_EN.md b/solution/0000-0099/0017.Letter Combinations of a Phone Number/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0017.Letter%20Combinations%20of%20a%20Phone%20Number/README.md)
 
+<!-- tags:Hash Table,String,Backtracking -->
+
 ## Description
 
 <p>Given a string containing digits from <code>2-9</code> inclusive, return all possible letter combinations that the number could represent. Return the answer in <strong>any order</strong>.</p>

diff --git a/solution/0000-0099/0018.4Sum/README.md b/solution/0000-0099/0018.4Sum/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0018.4Sum/README_EN.md)
 
+<!-- tags:数组,双指针,排序 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0018.4Sum/README_EN.md b/solution/0000-0099/0018.4Sum/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0018.4Sum/README.md)
 
+<!-- tags:Array,Two Pointers,Sorting -->
+
 ## Description
 
 <p>Given an array <code>nums</code> of <code>n</code> integers, return <em>an array of all the <strong>unique</strong> quadruplets</em> <code>[nums[a], nums[b], nums[c], nums[d]]</code> such that:</p>

diff --git a/solution/0000-0099/0019.Remove Nth Node From End of List/README.md b/solution/0000-0099/0019.Remove Nth Node From End of List/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/README_EN.md)
 
+<!-- tags:链表,双指针 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0019.Remove Nth Node From End of List/README_EN.md b/solution/0000-0099/0019.Remove Nth Node From End of List/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0019.Remove%20Nth%20Node%20From%20End%20of%20List/README.md)
 
+<!-- tags:Linked List,Two Pointers -->
+
 ## Description
 
 <p>Given the <code>head</code> of a linked list, remove the <code>n<sup>th</sup></code> node from the end of the list and return its head.</p>

diff --git a/solution/0000-0099/0020.Valid Parentheses/README.md b/solution/0000-0099/0020.Valid Parentheses/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0020.Valid%20Parentheses/README_EN.md)
 
+<!-- tags:栈,字符串 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0020.Valid Parentheses/README_EN.md b/solution/0000-0099/0020.Valid Parentheses/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0020.Valid%20Parentheses/README.md)
 
+<!-- tags:Stack,String -->
+
 ## Description
 
 <p>Given a string <code>s</code> containing just the characters <code>&#39;(&#39;</code>, <code>&#39;)&#39;</code>, <code>&#39;{&#39;</code>, <code>&#39;}&#39;</code>, <code>&#39;[&#39;</code> and <code>&#39;]&#39;</code>, determine if the input string is valid.</p>

diff --git a/solution/0000-0099/0021.Merge Two Sorted Lists/README.md b/solution/0000-0099/0021.Merge Two Sorted Lists/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README_EN.md)
 
+<!-- tags:递归,链表 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0021.Merge Two Sorted Lists/README_EN.md b/solution/0000-0099/0021.Merge Two Sorted Lists/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0021.Merge%20Two%20Sorted%20Lists/README.md)
 
+<!-- tags:Recursion,Linked List -->
+
 ## Description
 
 <p>You are given the heads of two sorted linked lists <code>list1</code> and <code>list2</code>.</p>

diff --git a/solution/0000-0099/0022.Generate Parentheses/README.md b/solution/0000-0099/0022.Generate Parentheses/README.md
@@ -2,6 +2,8 @@
 
 [English Version](/solution/0000-0099/0022.Generate%20Parentheses/README_EN.md)
 
+<!-- tags:字符串,动态规划,回溯 -->
+
 ## 题目描述
 
 <!-- 这里写题目描述 -->

diff --git a/solution/0000-0099/0022.Generate Parentheses/README_EN.md b/solution/0000-0099/0022.Generate Parentheses/README_EN.md
@@ -2,6 +2,8 @@
 
 [中文文档](/solution/0000-0099/0022.Generate%20Parentheses/README.md)
 
+<!-- tags:String,Dynamic Programming,Backtracking -->
+
 ## Description
 
 <p>Given <code>n</code> pairs of parentheses, write a function to <em>generate all combinations of well-formed parentheses</em>.</p>