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

Commitdbf96a2

Browse files
refactor 189
1 parent2fe08c3 commitdbf96a2

File tree

1 file changed

+1
-0
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+1
-0
lines changed

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

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -67,6 +67,7 @@ public static class Solution4 {
6767
* O(n) time
6868
* O(1) space
6969
* The most optimal, we can safely ignore all the above three solutions... :)
70+
* Credit: https://leetcode.com/problems/rotate-array/solution/ Approach #3
7071
*/
7172
publicvoidrotate(int[]nums,intk) {
7273
k =k %nums.length;

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp