Commit f346caf

iancarsonyanglbme

and

authored

feat: add java solution to lc problem: No.1220 (doocs#1897)

--------- Co-authored-by: iancarson <iancarson@users.noreply.github.com> Co-authored-by: Libin YANG <contact@yanglibin.info>

1 parent fd17349 commit f346cafCopy full SHA for f346caf

File tree

+52

-0

lines changed

+52

-0

lines changed

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -249,6 +249,32 @@ class Solution {`
`249`	`249`	`}`
`250`	`250`	```
`251`	`251`
	`252`	+```java
	`253`	`+class Solution {`
	`254`	`+ public int countVowelPermutation(int n) {`
	`255`	`+ final int mod = 1000000007;`
	`256`	`+ long countA = 1, countE = 1, countI = 1, countO = 1, countU = 1;`
	`257`	`+ for (int length = 1; length < n; length++) {`
	`258`	`+ // Calculate the next counts for each vowel based on the previous counts`
	`259`	`+ long nextCountA = countE;`
	`260`	`+ long nextCountE = (countA + countI) % mod;`
	`261`	`+ long nextCountI = (countA + countE + countO + countU) % mod;`
	`262`	`+ long nextCountO = (countI + countU) % mod;`
	`263`	`+ long nextCountU = countA;`
	`264`	`+ // Update the counts with the newly calculated values for the next length`
	`265`	`+ countA = nextCountA;`
	`266`	`+ countE = nextCountE;`
	`267`	`+ countI = nextCountI;`
	`268`	`+ countO = nextCountO;`
	`269`	`+ countU = nextCountU;`
	`270`	`+ }`
	`271`	`+ // Calculate the total count of valid strings for length n`
	`272`	`+ long totalCount = (countA + countE + countI + countO + countU) % mod;`
	`273`	`+ return (int) totalCount;`
	`274`	`+ }`
	`275`	`+}`
	`276`	+```
	`277`	`+`
`252`	`278`	`### C++`
`253`	`279`
`254`	`280`	```cpp

Lines changed: 26 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -215,6 +215,32 @@ class Solution {`
`215`	`215`	`}`
`216`	`216`	```
`217`	`217`
	`218`	+```java
	`219`	`+class Solution {`
	`220`	`+ public int countVowelPermutation(int n) {`
	`221`	`+ final int mod = 1000000007;`
	`222`	`+ long countA = 1, countE = 1, countI = 1, countO = 1, countU = 1;`
	`223`	`+ for (int length = 1; length < n; length++) {`
	`224`	`+ // Calculate the next counts for each vowel based on the previous counts`
	`225`	`+ long nextCountA = countE;`
	`226`	`+ long nextCountE = (countA + countI) % mod;`
	`227`	`+ long nextCountI = (countA + countE + countO + countU) % mod;`
	`228`	`+ long nextCountO = (countI + countU) % mod;`
	`229`	`+ long nextCountU = countA;`
	`230`	`+ // Update the counts with the newly calculated values for the next length`
	`231`	`+ countA = nextCountA;`
	`232`	`+ countE = nextCountE;`
	`233`	`+ countI = nextCountI;`
	`234`	`+ countO = nextCountO;`
	`235`	`+ countU = nextCountU;`
	`236`	`+ }`
	`237`	`+ // Calculate the total count of valid strings for length n`
	`238`	`+ long totalCount = (countA + countE + countI + countO + countU) % mod;`
	`239`	`+ return (int) totalCount;`
	`240`	`+ }`
	`241`	`+}`
	`242`	+```
	`243`	`+`
`218`	`244`	`### C++`
`219`	`245`
`220`	`246`	```cpp

Comments

(0)