refactor 189

fishercoder1534 · fishercoder1534 · commit dbf96a227f0b · 2021-09-13T11:39:24.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_189.java b/src/main/java/com/fishercoder/solutions/_189.java
@@ -67,6 +67,7 @@ public static class Solution4 {
          * O(n) time
          * O(1) space
          * The most optimal, we can safely ignore all the above three solutions... :)
+         * Credit: https://leetcode.com/problems/rotate-array/solution/ Approach #3
          */
         public void rotate(int[] nums, int k) {
             k = k % nums.length;
