feat: update solutions to lc problems: No.2325,2327,2328

* No.2325.Decode the Message
* No.2327.Number of People Aware of a Secret
* No.2328.Number of Increasing Paths in a Grid

Author: yanglbme

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

@@ -70,14 +70,14 @@
 ```python
 class Solution:
     def decodeMessage(self, key: str, message: str) -> str:
-        d = {}
+        d = {" ": " "}
         i = 0
-        for c in ''.join(key.split()):
+        for c in key:
             if c in d:
                 continue
             d[c] = ascii_lowercase[i]
             i += 1
-        return ''.join([' ' if c == ' ' else d[c] for c in message])
+        return "".join(d[c] for c in message)
 ```
 
 ### **Java**

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

@@ -58,14 +58,14 @@ It is obtained by taking the first appearance of each letter in &quot;<u><strong
 ```python
 class Solution:
     def decodeMessage(self, key: str, message: str) -> str:
-        d = {}
+        d = {" ": " "}
         i = 0
-        for c in ''.join(key.split()):
+        for c in key:
             if c in d:
                 continue
             d[c] = ascii_lowercase[i]
             i += 1
-        return ''.join([' ' if c == ' ' else d[c] for c in message])
+        return "".join(d[c] for c in message)
 ```
 
 ### **Java**

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

@@ -1,10 +1,10 @@
 class Solution:
     def decodeMessage(self, key: str, message: str) -> str:
-        d = {}
+        d = {" ": " "}
         i = 0
-        for c in ''.join(key.split()):
+        for c in key:
             if c in d:
                 continue
             d[c] = ascii_lowercase[i]
             i += 1
-        return ''.join([' ' if c == ' ' else d[c] for c in message])
+        return "".join(d[c] for c in message)

solution/2300-2399/2327.Number of People Aware of a Secret/README.md

@@ -64,8 +64,9 @@
 ```python
 class Solution:
     def peopleAwareOfSecret(self, n: int, delay: int, forget: int) -> int:
-        d = [0] * (n + 1010)
-        cnt = [0] * (n + 1010)
+        m = (n << 1) + 10
+        d = [0] * m
+        cnt = [0] * m
         cnt[1] = 1
         for i in range(1, n + 1):
             if cnt[i]:

solution/2300-2399/2327.Number of People Aware of a Secret/README_EN.md

@@ -54,8 +54,9 @@ Day 4: A forgets the secret. B, C, and D share the secret with 3 new people. (6
 ```python
 class Solution:
     def peopleAwareOfSecret(self, n: int, delay: int, forget: int) -> int:
-        d = [0] * (n + 1010)
-        cnt = [0] * (n + 1010)
+        m = (n << 1) + 10
+        d = [0] * m
+        cnt = [0] * m
         cnt[1] = 1
         for i in range(1, n + 1):
             if cnt[i]:

solution/2300-2399/2327.Number of People Aware of a Secret/Solution.py

@@ -1,7 +1,8 @@
 class Solution:
     def peopleAwareOfSecret(self, n: int, delay: int, forget: int) -> int:
-        d = [0] * (n + 1010)
-        cnt = [0] * (n + 1010)
+        m = (n << 1) + 10
+        d = [0] * m
+        cnt = [0] * m
         cnt[1] = 1
         for i in range(1, n + 1):
             if cnt[i]:

solution/2300-2399/2328.Number of Increasing Paths in a Grid/README.md

@@ -77,11 +77,7 @@ class Solution:
 
         m, n = len(grid), len(grid[0])
         mod = 10**9 + 7
-        ans = 0
-        for i in range(m):
-            for j in range(n):
-                ans += dfs(i, j)
-        return ans % mod
+        return sum(dfs(i, j) for i in range(m) for j in range(n)) % mod
 ```
 
 ### **Java**

solution/2300-2399/2328.Number of Increasing Paths in a Grid/README_EN.md

@@ -65,11 +65,7 @@ class Solution:
 
         m, n = len(grid), len(grid[0])
         mod = 10**9 + 7
-        ans = 0
-        for i in range(m):
-            for j in range(n):
-                ans += dfs(i, j)
-        return ans % mod
+        return sum(dfs(i, j) for i in range(m) for j in range(n)) % mod
 ```
 
 ### **Java**

solution/2300-2399/2328.Number of Increasing Paths in a Grid/Solution.py

@@ -11,8 +11,4 @@ def dfs(i, j):
 
         m, n = len(grid), len(grid[0])
         mod = 10**9 + 7
-        ans = 0
-        for i in range(m):
-            for j in range(n):
-                ans += dfs(i, j)
-        return ans % mod
+        return sum(dfs(i, j) for i in range(m) for j in range(n)) % mod