Create RotateArray.java

[mmudimba]

This is LeetCode solution to the "189.) Rotate Array" problem. Enjoy!

[javadev]

The alternative solution

class Solution {
    private void reverse(int[] nums, int l, int r) {
        while (l <= r) {
            int temp = nums[l];
            nums[l] = nums[r];
            nums[r] = temp;
            l++;
            r--;
        }
    }

    public void rotate(int[] nums, int k) {
        int n = nums.length;
        int t = n - (k % n);
        reverse(nums, 0, t - 1);
        reverse(nums, t, n - 1);
        reverse(nums, 0, n - 1);
    }
}

[Tanmaybhujade]

Both solution are correct

[Tanmaybhujade]

solution are correct

[Tanmaybhujade]

Both solution are correct

[Tanmaybhujade]

one more alternate solution.

public class Solution {
public void rotate(int[] nums, int k) {
if(nums.length <= 1) {
return;
}
k = k % nums.length;
int mid = nums.length - k;
reverse(nums, mid, nums.length - 1);
reverse(nums, 0, mid - 1);
reverse(nums, 0, nums.length - 1);
}

private void reverse(int[] nums, int start, int end) {
    while(start < end) {
        nums[start] = nums[start] ^ nums[end];
        nums[end] = nums[start] ^ nums[end];
        nums[start] = nums[start] ^ nums[end];
        start++;
        end--;
    }
}

}