Commit a5be53d

authored

Merge pull request SharingSource#316 from SharingSource/ac_oier

✨style: Modify 1220

2 parents 9791a2b + c7b3018 commit a5be53dCopy full SHA for a5be53d

File tree

-3

lines changed

-3

lines changed

Lines changed: 5 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -45,7 +45,7 @@ Tag : 「线性 DP」、「矩阵快速幂」`
`45`	`45`
`46`	`46`	`---`
`47`	`47`
`48`		`-## 线性 DP`
	`48`	`+### 线性 DP`
`49`	`49`
`50`	`50`	定义 $f[i][j]$ 为考虑长度为 $i + 1$ 的字符串,且结尾元素为 $j$ 的方案数(其中 $j$ 代表数组 `['a', 'e', 'i', 'o', 'u']` 下标)。
`51`	`51`
`@@ -116,7 +116,8 @@ class Solution {`
`116`	`116`	`}`
`117`	`117`	```
`118`	`118`	`-`
`119`		-```Python3
	`119`	`+`
	`120`	+```Python
`120`	`121`	`MOD = int(1e9) + 7`
`121`	`122`	`class Solution:`
`122`	`123`	`def countVowelPermutation(self, n: int) -> int:`
`@@ -130,6 +131,7 @@ class Solution:`
`130`	`131`	`return (((((f[-1][0] + f[-1][1]) % MOD + f[-1][2]) % MOD + f[-1][3]) % MOD) + f[-1][4]) % MOD`
`131`	`132`	```
`132`	`133`	`-`
	`134`	`+`
`133`	`135`	```Go
`134`	`136`	`const MOD int = 1e9 + 7`
`135`	`137`	`func countVowelPermutation(n int) int {`
`@@ -363,7 +365,7 @@ class Solution {`
`363`	`365`	`}`
`364`	`366`	```
`365`	`367`	`-`
`366`		-```Python3
	`368`	+```python
`367`	`369`	`import numpy as np`
`368`	`370`	`MOD = 10 ** 9 + 7`
`369`	`371`	`dtype = np.dtype('uint64')`

Comments

(0)