Skip to content

Commit ebcb794

Browse files
yanglbmeyanglbme
committed
feat: add solutions to lc problems: No.2325~2328
* No.2325.Decode the Message * No.2326.Spiral Matrix IV * No.2327.Number of People Aware of a Secret * No.2328.Number of Increasing Paths in a Grid
1 parent d922931 commit ebcb794

36 files changed

+1948
-1
lines changed

‎README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -14,7 +14,7 @@
1414

1515
## 介绍
1616

17-
本项目包含 LeetCode、《剑指 Offer（第 2 版）》、《剑指 Offer（专项突击版）》、《程序员面试金典（第 6 版）》等题目的相关题解。所有题解均由多种编程语言实现，包括但不限于：Java、Python、C++、JavaScript、C#、Go，日常更新。欢迎 Star 🌟 关注[本项目](https://github.com/doocs/leetcode)，获取项目最新动态。
17+
本项目包含 LeetCode、《剑指 Offer（第 2 版）》、《剑指 Offer（专项突击版）》、《程序员面试金典（第 6 版）》等题目的相关题解。所有题解均由多种编程语言实现，包括但不限于：Java、Python、C++、Go、TypeScript、Rust，日常更新。欢迎 Star 🌟 关注[本项目](https://github.com/doocs/leetcode)，获取项目最新动态。
1818

1919
[English Version](/README_EN.md)
2020

‎solution/2300-2399/2325.Decode the Message/README.md

+166
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,166 @@
1+
# [2325. 解密消息](https://leetcode.cn/problems/decode-the-message)
2+
3+
[English Version](/solution/2300-2399/2325.Decode%20the%20Message/README_EN.md)
4+
5+
## 题目描述
6+
7+
<!-- 这里写题目描述 -->
8+
9+
<p>给你字符串 <code>key</code> 和 <code>message</code> ，分别表示一个加密密钥和一段加密消息。解密 <code>message</code> 的步骤如下：</p>
10+
11+
<ol>
12+
<li>使用 <code>key</code> 中 26 个英文小写字母第一次出现的顺序作为替换表中的字母 <strong>顺序</strong> 。</li>
13+
<li>将替换表与普通英文字母表对齐，形成对照表。</li>
14+
<li>按照对照表 <strong>替换</strong> <code>message</code> 中的每个字母。</li>
15+
<li>空格 <code>' '</code> 保持不变。</li>
16+
</ol>
17+
18+
<ul>
19+
<li>例如，<code>key = "<em><strong>hap</strong></em>p<em><strong>y</strong></em> <em><strong>bo</strong></em>y"</code>（实际的加密密钥会包含字母表中每个字母 <strong>至少一次</strong>），据此，可以得到部分对照表（<code>'h' -&gt; 'a'</code>、<code>'a' -&gt; 'b'</code>、<code>'p' -&gt; 'c'</code>、<code>'y' -&gt; 'd'</code>、<code>'b' -&gt; 'e'</code>、<code>'o' -&gt; 'f'</code>）。</li>
20+
</ul>
21+
22+
<p>返回解密后的消息。</p>
23+
24+
<p>&nbsp;</p>
25+
26+
<p><strong>示例 1：</strong></p>
27+
28+
<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2300-2399/2325.Decode%20the%20Message/images/ex1new4.jpg" style="width: 752px; height: 150px;" /></p>
29+
30+
<pre>
31+
<strong>输入：</strong>key = "the quick brown fox jumps over the lazy dog", message = "vkbs bs t suepuv"
32+
<strong>输出：</strong>"this is a secret"
33+
<strong>解释：</strong>对照表如上图所示。
34+
提取 "<em><strong>the</strong></em> <em><strong>quick</strong></em> <em><strong>brown</strong></em> <em><strong>f</strong></em>o<em><strong>x</strong></em> <em><strong>j</strong></em>u<em><strong>mps</strong></em> o<em><strong>v</strong></em>er the <em><strong>lazy</strong></em> <em><strong>d</strong></em>o<em><strong>g</strong></em>" 中每个字母的首次出现可以得到替换表。
35+
</pre>
36+
37+
<p><strong>示例 2：</strong></p>
38+
39+
<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2300-2399/2325.Decode%20the%20Message/images/ex2new.jpg" style="width: 754px; height: 150px;" /></p>
40+
41+
<pre>
42+
<strong>输入：</strong>key = "eljuxhpwnyrdgtqkviszcfmabo", message = "zwx hnfx lqantp mnoeius ycgk vcnjrdb"
43+
<strong>输出：</strong>"the five boxing wizards jump quickly"
44+
<strong>解释：</strong>对照表如上图所示。
45+
提取 "<em><strong>eljuxhpwnyrdgtqkviszcfmabo</strong></em>" 中每个字母的首次出现可以得到替换表。
46+
</pre>
47+
48+
<p>&nbsp;</p>
49+
50+
<p><strong>提示：</strong></p>
51+
52+
<ul>
53+
<li><code>26 &lt;= key.length &lt;= 2000</code></li>
54+
<li><code>key</code> 由小写英文字母及 <code>' '</code> 组成</li>
55+
<li><code>key</code> 包含英文字母表中每个字符（<code>'a'</code> 到 <code>'z'</code>）<strong>至少一次</strong></li>
56+
<li><code>1 &lt;= message.length &lt;= 2000</code></li>
57+
<li><code>message</code> 由小写英文字母和 <code>' '</code> 组成</li>
58+
</ul>
59+
60+
## 解法
61+
62+
<!-- 这里可写通用的实现逻辑 -->
63+
64+
<!-- tabs:start -->
65+
66+
### **Python3**
67+
68+
<!-- 这里可写当前语言的特殊实现逻辑 -->
69+
70+
```python
71+
class Solution:
72+
def decodeMessage(self, key: str, message: str) -> str:
73+
d = {}
74+
i = 0
75+
for c in ''.join(key.split()):
76+
if c in d:
77+
continue
78+
d[c] = ascii_lowercase[i]
79+
i += 1
80+
return ''.join([' ' if c == ' ' else d[c] for c in message])
81+
```
82+
83+
### **Java**
84+
85+
<!-- 这里可写当前语言的特殊实现逻辑 -->
86+
87+
```java
88+
class Solution {
89+
public String decodeMessage(String key, String message) {
90+
Map<Character, Character> d = new HashMap<>();
91+
String lowcase = "abcdefghijklmnopqrstuvwxyz";
92+
d.put(' ', ' ');
93+
int i = 0;
94+
for (char c : key.toCharArray()) {
95+
if (d.containsKey(c)) {
96+
continue;
97+
}
98+
d.put(c, lowcase.charAt(i++));
99+
}
100+
StringBuilder ans = new StringBuilder();
101+
for (char c : message.toCharArray()) {
102+
ans.append(d.get(c));
103+
}
104+
return ans.toString();
105+
}
106+
}
107+
```
108+
109+
### **C++**
110+
111+
```cpp
112+
class Solution {
113+
public:
114+
string decodeMessage(string key, string message) {
115+
unordered_map<char, char> d;
116+
d[' '] = ' ';
117+
int i = 0;
118+
string lowcase = "abcdefghijklmnopqrstuvwxyz";
119+
for (char c : key)
120+
{
121+
if (d.count(c)) continue;
122+
d[c] = lowcase[i]++;
123+
}
124+
string ans;
125+
for (char c : message) ans.push_back(d[c]);
126+
return ans;
127+
}
128+
};
129+
```
130+
131+
### **Go**
132+
133+
```go
134+
func decodeMessage(key string, message string) string {
135+
d := map[rune]byte{}
136+
d[' '] = ' '
137+
i := 0
138+
lowcase := "abcdefghijklmnopqrstuvwxyz"
139+
for _, c := range key {
140+
if _, ok := d[c]; ok {
141+
continue
142+
}
143+
d[c] = lowcase[i]
144+
i++
145+
}
146+
var ans []byte
147+
for _, c := range message {
148+
ans = append(ans, d[c])
149+
}
150+
return string(ans)
151+
}
152+
```
153+
154+
### **TypeScript**
155+
156+
```ts
157+
158+
```
159+
160+
### **...**
161+
162+
```
163+
164+
```
165+
166+
<!-- tabs:end -->

‎solution/2300-2399/2325.Decode the Message/README_EN.md

+152
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,152 @@
1+
# [2325. Decode the Message](https://leetcode.com/problems/decode-the-message)
2+
3+
[中文文档](/solution/2300-2399/2325.Decode%20the%20Message/README.md)
4+
5+
## Description
6+
7+
<p>You are given the strings <code>key</code> and <code>message</code>, which represent a cipher key and a secret message, respectively. The steps to decode <code>message</code> are as follows:</p>
8+
9+
<ol>
10+
<li>Use the <strong>first</strong> appearance of all 26 lowercase English letters in <code>key</code> as the <strong>order</strong> of the substitution table.</li>
11+
<li>Align the substitution table with the regular English alphabet.</li>
12+
<li>Each letter in <code>message</code> is then <strong>substituted</strong> using the table.</li>
13+
<li>Spaces <code>&#39; &#39;</code> are transformed to themselves.</li>
14+
</ol>
15+
16+
<ul>
17+
<li>For example, given <code>key = &quot;<u><strong>hap</strong></u>p<u><strong>y</strong></u> <u><strong>bo</strong></u>y&quot;</code> (actual key would have <strong>at least one</strong> instance of each letter in the alphabet), we have the partial substitution table of (<code>&#39;h&#39; -&gt; &#39;a&#39;</code>, <code>&#39;a&#39; -&gt; &#39;b&#39;</code>, <code>&#39;p&#39; -&gt; &#39;c&#39;</code>, <code>&#39;y&#39; -&gt; &#39;d&#39;</code>, <code>&#39;b&#39; -&gt; &#39;e&#39;</code>, <code>&#39;o&#39; -&gt; &#39;f&#39;</code>).</li>
18+
</ul>
19+
20+
<p>Return <em>the decoded message</em>.</p>
21+
22+
<p>&nbsp;</p>
23+
<p><strong>Example 1:</strong></p>
24+
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2300-2399/2325.Decode%20the%20Message/images/ex1new4.jpg" style="width: 752px; height: 150px;" />
25+
<pre>
26+
<strong>Input:</strong> key = &quot;the quick brown fox jumps over the lazy dog&quot;, message = &quot;vkbs bs t suepuv&quot;
27+
<strong>Output:</strong> &quot;this is a secret&quot;
28+
<strong>Explanation:</strong> The diagram above shows the substitution table.
29+
It is obtained by taking the first appearance of each letter in &quot;<u><strong>the</strong></u> <u><strong>quick</strong></u> <u><strong>brown</strong></u> <u><strong>f</strong></u>o<u><strong>x</strong></u> <u><strong>j</strong></u>u<u><strong>mps</strong></u> o<u><strong>v</strong></u>er the <u><strong>lazy</strong></u> <u><strong>d</strong></u>o<u><strong>g</strong></u>&quot;.
30+
</pre>
31+
32+
<p><strong>Example 2:</strong></p>
33+
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2300-2399/2325.Decode%20the%20Message/images/ex2new.jpg" style="width: 754px; height: 150px;" />
34+
<pre>
35+
<strong>Input:</strong> key = &quot;eljuxhpwnyrdgtqkviszcfmabo&quot;, message = &quot;zwx hnfx lqantp mnoeius ycgk vcnjrdb&quot;
36+
<strong>Output:</strong> &quot;the five boxing wizards jump quickly&quot;
37+
<strong>Explanation:</strong> The diagram above shows the substitution table.
38+
It is obtained by taking the first appearance of each letter in &quot;<u><strong>eljuxhpwnyrdgtqkviszcfmabo</strong></u>&quot;.
39+
</pre>
40+
41+
<p>&nbsp;</p>
42+
<p><strong>Constraints:</strong></p>
43+
44+
<ul>
45+
<li><code>26 &lt;= key.length &lt;= 2000</code></li>
46+
<li><code>key</code> consists of lowercase English letters and <code>&#39; &#39;</code>.</li>
47+
<li><code>key</code> contains every letter in the English alphabet (<code>&#39;a&#39;</code> to <code>&#39;z&#39;</code>) <strong>at least once</strong>.</li>
48+
<li><code>1 &lt;= message.length &lt;= 2000</code></li>
49+
<li><code>message</code> consists of lowercase English letters and <code>&#39; &#39;</code>.</li>
50+
</ul>
51+
52+
## Solutions
53+
54+
<!-- tabs:start -->
55+
56+
### **Python3**
57+
58+
```python
59+
class Solution:
60+
def decodeMessage(self, key: str, message: str) -> str:
61+
d = {}
62+
i = 0
63+
for c in ''.join(key.split()):
64+
if c in d:
65+
continue
66+
d[c] = ascii_lowercase[i]
67+
i += 1
68+
return ''.join([' ' if c == ' ' else d[c] for c in message])
69+
```
70+
71+
### **Java**
72+
73+
```java
74+
class Solution {
75+
public String decodeMessage(String key, String message) {
76+
Map<Character, Character> d = new HashMap<>();
77+
String lowcase = "abcdefghijklmnopqrstuvwxyz";
78+
d.put(' ', ' ');
79+
int i = 0;
80+
for (char c : key.toCharArray()) {
81+
if (d.containsKey(c)) {
82+
continue;
83+
}
84+
d.put(c, lowcase.charAt(i++));
85+
}
86+
StringBuilder ans = new StringBuilder();
87+
for (char c : message.toCharArray()) {
88+
ans.append(d.get(c));
89+
}
90+
return ans.toString();
91+
}
92+
}
93+
```
94+
95+
### **C++**
96+
97+
```cpp
98+
class Solution {
99+
public:
100+
string decodeMessage(string key, string message) {
101+
unordered_map<char, char> d;
102+
d[' '] = ' ';
103+
int i = 0;
104+
string lowcase = "abcdefghijklmnopqrstuvwxyz";
105+
for (char c : key)
106+
{
107+
if (d.count(c)) continue;
108+
d[c] = lowcase[i]++;
109+
}
110+
string ans;
111+
for (char c : message) ans.push_back(d[c]);
112+
return ans;
113+
}
114+
};
115+
```
116+
117+
### **Go**
118+
119+
```go
120+
func decodeMessage(key string, message string) string {
121+
d := map[rune]byte{}
122+
d[' '] = ' '
123+
i := 0
124+
lowcase := "abcdefghijklmnopqrstuvwxyz"
125+
for _, c := range key {
126+
if _, ok := d[c]; ok {
127+
continue
128+
}
129+
d[c] = lowcase[i]
130+
i++
131+
}
132+
var ans []byte
133+
for _, c := range message {
134+
ans = append(ans, d[c])
135+
}
136+
return string(ans)
137+
}
138+
```
139+
140+
### **TypeScript**
141+
142+
```ts
143+
144+
```
145+
146+
### **...**
147+
148+
```
149+
150+
```
151+
152+
<!-- tabs:end -->

‎solution/2300-2399/2325.Decode the Message/Solution.cpp

+17
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,17 @@
1+
class Solution {
2+
public:
3+
string decodeMessage(string key, string message) {
4+
unordered_map<char, char> d;
5+
d[' '] = ' ';
6+
int i = 0;
7+
string lowcase = "abcdefghijklmnopqrstuvwxyz";
8+
for (char c : key)
9+
{
10+
if (d.count(c)) continue;
11+
d[c] = lowcase[i]++;
12+
}
13+
string ans;
14+
for (char c : message) ans.push_back(d[c]);
15+
return ans;
16+
}
17+
};

‎solution/2300-2399/2325.Decode the Message/Solution.go

+18
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,18 @@
1+
func decodeMessage(key string, message string) string {
2+
d := map[rune]byte{}
3+
d[' '] = ' '
4+
i := 0
5+
lowcase := "abcdefghijklmnopqrstuvwxyz"
6+
for _, c := range key {
7+
if _, ok := d[c]; ok {
8+
continue
9+
}
10+
d[c] = lowcase[i]
11+
i++
12+
}
13+
var ans []byte
14+
for _, c := range message {
15+
ans = append(ans, d[c])
16+
}
17+
return string(ans)
18+
}

‎solution/2300-2399/2325.Decode the Message/Solution.java

+19
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
class Solution {
2+
public String decodeMessage(String key, String message) {
3+
Map<Character, Character> d = new HashMap<>();
4+
String lowcase = "abcdefghijklmnopqrstuvwxyz";
5+
d.put(' ', ' ');
6+
int i = 0;
7+
for (char c : key.toCharArray()) {
8+
if (d.containsKey(c)) {
9+
continue;
10+
}
11+
d.put(c, lowcase.charAt(i++));
12+
}
13+
StringBuilder ans = new StringBuilder();
14+
for (char c : message.toCharArray()) {
15+
ans.append(d.get(c));
16+
}
17+
return ans.toString();
18+
}
19+
}

‎solution/2300-2399/2325.Decode the Message/Solution.py

+10
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,10 @@
1+
class Solution:
2+
def decodeMessage(self, key: str, message: str) -> str:
3+
d = {}
4+
i = 0
5+
for c in ''.join(key.split()):
6+
if c in d:
7+
continue
8+
d[c] = ascii_lowercase[i]
9+
i += 1
10+
return ''.join([' ' if c == ' ' else d[c] for c in message])

‎solution/2300-2399/2325.Decode the Message/images/ex1new4.jpg

28.5 KB
Loading

‎solution/2300-2399/2325.Decode the Message/images/ex2new.jpg

27.1 KB
Loading

0 commit comments

Comments
 (0)