Skip to content

✨style: Modify 1220 #316

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Jan 17, 2022
Merged

✨style: Modify 1220 #316

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
ae5aa68
✨style: Modify 382
SharingSource Jan 17, 2022
c7b3018
✨style: Modify 1220
SharingSource Jan 17, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 5 additions & 3 deletions LeetCode/1211-1220/1220. 统计元音字母序列的数目（困难）.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -45,7 +45,7 @@ Tag : 「线性 DP」、「矩阵快速幂」

---

## 线性 DP
### 线性 DP

**定义 $f[i][j]$ 为考虑长度为 $i + 1$ 的字符串，且结尾元素为 $j$ 的方案数（其中 $j$ 代表数组 `['a', 'e', 'i', 'o', 'u']` 下标）。**

Expand Down Expand Up @@ -116,7 +116,8 @@ class Solution {
}
```
-
```Python3

```Python
MOD = int(1e9) + 7
class Solution:
def countVowelPermutation(self, n: int) -> int:
Expand All @@ -130,6 +131,7 @@ class Solution:
return (((((f[-1][0] + f[-1][1]) % MOD + f[-1][2]) % MOD + f[-1][3]) % MOD) + f[-1][4]) % MOD
```
-

```Go
const MOD int = 1e9 + 7
func countVowelPermutation(n int) int {
Expand Down Expand Up @@ -363,7 +365,7 @@ class Solution {
}
```
-
```Python3
```python
import numpy as np
MOD = 10 ** 9 + 7
dtype = np.dtype('uint64')
Expand Down