LeetCode--189--easy--RotateArray

package com.app.main.LeetCode;

import java.util.Stack;

/**
 * 189
 *
 * easy
 *
 * https://leetcode.com/problems/rotate-array/
 *
 * Given an array, rotate the array to the right by k steps, where k is non-negative.
 *
 * Example 1:
 *
 * Input: [1,2,3,4,5,6,7] and k = 3
 * Output: [5,6,7,1,2,3,4]
 * Explanation:
 * rotate 1 steps to the right: [7,1,2,3,4,5,6]
 * rotate 2 steps to the right: [6,7,1,2,3,4,5]
 * rotate 3 steps to the right: [5,6,7,1,2,3,4]
 * Example 2:
 *
 * Input: [-1,-100,3,99] and k = 2
 * Output: [3,99,-1,-100]
 * Explanation:
 * rotate 1 steps to the right: [99,-1,-100,3]
 * rotate 2 steps to the right: [3,99,-1,-100]
 * Note:
 *
 * Try to come up as many solutions as you can, there are at least 3 different ways to solve this problem.
 * Could you do it in-place with O(1) extra space?
 * Created with IDEA
 * author:Dingsheng Huang
 * Date:2019/10/2
 * Time:下午10:49
 */
public class RotateArray {

    public void rotate(int[] nums, int k) {
        int len = nums.length;
        if (k % len == 0) {
            return;
        } else {
            k = k % len;
        }

        Stack<Integer> stack = new Stack<>();
        Stack<Integer> stack1 = new Stack<>();
        for (int i = len - 1; i >= 0; i--) {
            if (i > len - k - 1) {
                stack.push(nums[i]);
            } else {
                stack1.push(nums[i]);
            }
        }



        int m = 0;
        while (!stack.isEmpty()) {
            nums[m] = stack.pop();
            m++;
        }
        while (!stack1.isEmpty()) {
            nums[m] = stack1.pop();
            m++;
        }


    }
}