LeetCode Daily 2 Questions 01: Rotating Arrays (both 1200 questions)

The title is as follows

Problem solving idea: We can use an extra array toPut each element in the correct position.Let nn represent the length of the array, we traverse the original array, put the element with the subscript ii of the original array to the position of the new array subscript (i+k)\bmod n(i+k)modn, and finally copy the new arrayto the original array.

public void rotate(int[] nums, int k) {int n = nums.length;//7 [1,2,3,4,5,6,7] k=3 [5,6,7,1,2,3,4]int[] newArr = new int[n];//new arrayfor (int i = 0; i <n; ++i) {//0 1 2 3 4 5 6 n=7newArr[(i + k) % n] =span> nums[i];//Array in newArr = Swap array positions in newArr}System.arraycopy(newArr, 0, nums, 0, n);//Copy the value in index newArr from zero index to zero in numsIndex and copy length 7}