Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit5a438cf

Browse files
update comment for 1641
1 parent3d1ba93 commit5a438cf

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

‎src/main/java/com/fishercoder/solutions/_1641.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@ public static class Solution1 {
88
* I solved this problem using Math, no DP, recursion or backtracking techniques.
99
* Time: beat 100% submission consistently since it's O(n), essentialy it's O(1) because the contraints in the problem state: 1 <= n <= 50
1010
* After writing out from n = 1 to 3, we can see the pattern.
11-
* Detailed reasoning to be seen in myyoutube video on my channel: https://www.youtube.com/fishercoder.
11+
* Detailed reasoning to be seen in myYouTube video on my channel: https://youtu.be/gdH4yfgfwiU
1212
*/
1313
publicintcountVowelStrings(intn) {
1414
if (n ==1) {

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp