feat: add solutions to lc problem: No.0320

No.0320.Generalized Abbreviation

Author: yanglbme

solution/0300-0399/0320.Generalized Abbreviation/README.md

@@ -6,22 +6,52 @@
 
 <!-- 这里写题目描述 -->
 
-<p>请你写出一个能够举单词全部缩写的函数。</p>
+<p>单词的 <strong>广义缩写词</strong> 可以通过下述步骤构造：先取任意数量的不重叠的子字符串，再用它们各自的长度进行替换。
 
-<p><strong>注意：</strong>输出的顺序并不重要。</p>
+例如：
 
-<p><strong>示例：</strong></p>
+- <code>"abcde"</code> 可以缩写为 <code>"a3e"</code>（<code>"bcd"</code> 变为 <code>"3"</code> ）
+- <code>"1bcd1"</code>（<code>"a"</code> 和 <code>"e"</code> 都变为 <code>"1"</code>）
+- <code>"5"</code>（<code>"abcde"</code> 变为 <code>"5"</code>）
 
-<pre><strong>输入:</strong> <code>&quot;word&quot;</code>
-<strong>输出:</strong>
-[&quot;word&quot;, &quot;1ord&quot;, &quot;w1rd&quot;, &quot;wo1d&quot;, &quot;wor1&quot;, &quot;2rd&quot;, &quot;w2d&quot;, &quot;wo2&quot;, &quot;1o1d&quot;, &quot;1or1&quot;, &quot;w1r1&quot;, &quot;1o2&quot;, &quot;2r1&quot;, &quot;3d&quot;, &quot;w3&quot;, &quot;4&quot;]
+但是，这些缩写是无效的：
+
+- <code>"23"</code>（<code>"ab"</code> 变为 <code>"2"</code> ，<code>"cde"</code> 变为 <code>"3"</code> ），选择的子串是相邻的。
+- <code>"22de"</code>（<code>"ab"</code> 变为 <code>"2"</code> ，<code>"bc"</code> 变为 <code>"2"</code> ），选择的子串重叠了。
+
+</p>
+
+<p>给你一个字符串 <code>word</code> ，返回一个由所有可能 <strong>广义缩写词</strong> 组成的列表。按 <strong>任意顺序</strong> 返回答案。</p>
+
+<p> </p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>word = "word"
+<strong>输出：</strong>["4","3d","2r1","2rd","1o2","1o1d","1or1","1ord","w3","w2d","w1r1","w1rd","wo2","wo1d","wor1","word"]
 </pre>
 
-<p>&nbsp;</p>
+<p><strong>示例 2：</strong></p>
 
+<pre>
+<strong>输入：</strong>word = "a"
+<strong>输出：</strong>["1","a"]
+</pre>
+
+<p> </p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 <= word.length <= 15</code></li>
+	<li><code>word</code> 仅由小写英文字母组成</li>
+</ul>
 
 ## 解法
 
+回溯法。
+
 <!-- 这里可写通用的实现逻辑 -->
 
 <!-- tabs:start -->
@@ -31,15 +61,67 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def generateAbbreviations(self, word: str) -> List[str]:
+        def dfs(s, t):
+            if not s:
+                ans.append(''.join(t))
+                return
+            for i in range(1, len(s) + 1):
+                t.append(str(i))
+                if i < len(s):
+                    t.append(s[i])
+                    dfs(s[i + 1:], t)
+                    t.pop()
+                else:
+                    dfs(s[i:], t)
+                t.pop()
+
+            t.append(s[0])
+            dfs(s[1:], t)
+            t.pop()
+
+        ans = []
+        dfs(word, [])
+        return ans
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    private List<String> ans;
+
+    public List<String> generateAbbreviations(String word) {
+        ans = new ArrayList<>();
+        List<String> t = new ArrayList<>();
+        dfs(word, t);
+        return ans;
+    }
+
+    private void dfs(String s, List<String> t) {
+        if ("".equals(s)) {
+            ans.add(String.join("", t));
+            return;
+        }
+        for (int i = 1; i < s.length() + 1; ++i) {
+            t.add(i + "");
+            if (i < s.length()) {
+                t.add(String.valueOf(s.charAt(i)));
+                dfs(s.substring(i + 1), t);
+                t.remove(t.size() - 1);
+            } else {
+                dfs(s.substring(i), t);
+            }
+            t.remove(t.size() - 1);
+        }
+        t.add(String.valueOf(s.charAt(0)));
+        dfs(s.substring(1), t);
+        t.remove(t.size() - 1);
+    }
+}
 ```
 
 ### **...**

solution/0300-0399/0320.Generalized Abbreviation/README_EN.md

@@ -4,7 +4,24 @@
 
 ## Description
 
-<p>A word&#39;s&nbsp;<strong>generalized abbreviation</strong>&nbsp;can be constructed by taking any number of non-overlapping substrings and replacing them with their respective lengths. For example, <code>&quot;abcde&quot;</code> can be abbreviated into <code>&quot;a3e&quot;</code> (<code>&quot;bcd&quot;</code> turned into <code>&quot;3&quot;</code>), <code>&quot;1bcd1&quot;</code> (<code>&quot;a&quot;</code> and <code>&quot;e&quot;</code> both turned into <code>&quot;1&quot;</code>), and <code>&quot;23&quot;</code> (<code>&quot;ab&quot;</code> turned into <code>&quot;2&quot;</code> and <code>&quot;cde&quot;</code> turned into <code>&quot;3&quot;</code>).</p>
+<p>A word&#39;s <strong>generalized abbreviation</strong> can be constructed by taking any number of <strong>non-overlapping</strong> and <strong>non-adjacent</strong> substrings and replacing them with their respective lengths.</p>
+
+<ul>
+	<li>For example, <code>&quot;abcde&quot;</code> can be abbreviated into:
+	<ul>
+		<li><code>&quot;a3e&quot;</code> (<code>&quot;bcd&quot;</code> turned into <code>&quot;3&quot;</code>)</li>
+		<li><code>&quot;1bcd1&quot;</code> (<code>&quot;a&quot;</code> and <code>&quot;e&quot;</code> both turned into <code>&quot;1&quot;</code>)</li>
+		<li><code>&quot;5&quot;</code> (<code>&quot;abcde&quot;</code> turned into <code>&quot;5&quot;</code>)</li>
+		<li><code>&quot;abcde&quot;</code> (no substrings replaced)</li>
+	</ul>
+	</li>
+	<li>However, these abbreviations are <strong>invalid</strong>:
+	<ul>
+		<li><code>&quot;23&quot;</code> (<code>&quot;ab&quot;</code> turned into <code>&quot;2&quot;</code> and <code>&quot;cde&quot;</code> turned into <code>&quot;3&quot;</code>) is invalid as the substrings chosen are adjacent.</li>
+		<li><code>&quot;22de&quot;</code> (<code>&quot;ab&quot;</code> turned into <code>&quot;2&quot;</code> and <code>&quot;bc&quot;</code> turned into <code>&quot;2&quot;</code>) is invalid as the substring chosen overlap.</li>
+	</ul>
+	</li>
+</ul>
 
 <p>Given a string <code>word</code>, return <em>a list of all the possible <strong>generalized abbreviations</strong> of</em> <code>word</code>. Return the answer in <strong>any order</strong>.</p>
 
@@ -24,21 +41,72 @@
 	<li><code>word</code> consists of only lowercase English letters.</li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def generateAbbreviations(self, word: str) -> List[str]:
+        def dfs(s, t):
+            if not s:
+                ans.append(''.join(t))
+                return
+            for i in range(1, len(s) + 1):
+                t.append(str(i))
+                if i < len(s):
+                    t.append(s[i])
+                    dfs(s[i + 1:], t)
+                    t.pop()
+                else:
+                    dfs(s[i:], t)
+                t.pop()
+
+            t.append(s[0])
+            dfs(s[1:], t)
+            t.pop()
+
+        ans = []
+        dfs(word, [])
+        return ans
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    private List<String> ans;
+
+    public List<String> generateAbbreviations(String word) {
+        ans = new ArrayList<>();
+        List<String> t = new ArrayList<>();
+        dfs(word, t);
+        return ans;
+    }
+
+    private void dfs(String s, List<String> t) {
+        if ("".equals(s)) {
+            ans.add(String.join("", t));
+            return;
+        }
+        for (int i = 1; i < s.length() + 1; ++i) {
+            t.add(i + "");
+            if (i < s.length()) {
+                t.add(String.valueOf(s.charAt(i)));
+                dfs(s.substring(i + 1), t);
+                t.remove(t.size() - 1);
+            } else {
+                dfs(s.substring(i), t);
+            }
+            t.remove(t.size() - 1);
+        }
+        t.add(String.valueOf(s.charAt(0)));
+        dfs(s.substring(1), t);
+        t.remove(t.size() - 1);
+    }
+}
 ```
 
 ### **...**

solution/0300-0399/0320.Generalized Abbreviation/Solution.java

@@ -0,0 +1,31 @@
+class Solution {
+    private List<String> ans;
+
+    public List<String> generateAbbreviations(String word) {
+        ans = new ArrayList<>();
+        List<String> t = new ArrayList<>();
+        dfs(word, t);
+        return ans;
+    }
+
+    private void dfs(String s, List<String> t) {
+        if ("".equals(s)) {
+            ans.add(String.join("", t));
+            return;
+        }
+        for (int i = 1; i < s.length() + 1; ++i) {
+            t.add(i + "");
+            if (i < s.length()) {
+                t.add(String.valueOf(s.charAt(i)));
+                dfs(s.substring(i + 1), t);
+                t.remove(t.size() - 1);
+            } else {
+                dfs(s.substring(i), t);
+            }
+            t.remove(t.size() - 1);
+        }
+        t.add(String.valueOf(s.charAt(0)));
+        dfs(s.substring(1), t);
+        t.remove(t.size() - 1);
+    }
+}

solution/0300-0399/0320.Generalized Abbreviation/Solution.py

@@ -0,0 +1,23 @@
+class Solution:
+    def generateAbbreviations(self, word: str) -> List[str]:
+        def dfs(s, t):
+            if not s:
+                ans.append(''.join(t))
+                return
+            for i in range(1, len(s) + 1):
+                t.append(str(i))
+                if i < len(s):
+                    t.append(s[i])
+                    dfs(s[i + 1:], t)
+                    t.pop()
+                else:
+                    dfs(s[i:], t)
+                t.pop()
+
+            t.append(s[0])
+            dfs(s[1:], t)
+            t.pop()
+
+        ans = []
+        dfs(word, [])
+        return ans

solution/0900-0999/0911.Online Election/README.md

@@ -76,12 +76,12 @@ class TopVotedCandidate:
         mx = cur = 0
         counter = Counter()
         self.times = times
-        self.wins = [0] * len(persons)
+        self.wins = []
         for i, p in enumerate(persons):
             counter[p] += 1
             if counter[p] >= mx:
                 mx, cur = counter[p], p
-            self.wins[i] = cur
+            self.wins.append(cur)
 
     def q(self, t: int) -> int:
         left, right = 0, len(self.wins) - 1

solution/0900-0999/0911.Online Election/README_EN.md

@@ -64,12 +64,12 @@ class TopVotedCandidate:
         mx = cur = 0
         counter = Counter()
         self.times = times
-        self.wins = [0] * len(persons)
+        self.wins = []
         for i, p in enumerate(persons):
             counter[p] += 1
             if counter[p] >= mx:
                 mx, cur = counter[p], p
-            self.wins[i] = cur
+            self.wins.append(cur)
 
     def q(self, t: int) -> int:
         left, right = 0, len(self.wins) - 1

solution/0900-0999/0911.Online Election/Solution.py

@@ -4,12 +4,12 @@ def __init__(self, persons: List[int], times: List[int]):
         mx = cur = 0
         counter = Counter()
         self.times = times
-        self.wins = [0] * len(persons)
+        self.wins = []
         for i, p in enumerate(persons):
             counter[p] += 1
             if counter[p] >= mx:
                 mx, cur = counter[p], p
-            self.wins[i] = cur
+            self.wins.append(cur)
 
     def q(self, t: int) -> int:
         left, right = 0, len(self.wins) - 1