Код: Выделить всё
Example 1:
Input: nums = [1,2,3,4,5,6,7], 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: nums = [-1,-100,3,99], 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]
Код: Выделить всё
class Solution {
public:
void rotate(vector& nums, int k) {
int n = sizeof(nums)/sizeof(nums[0]);
k = k%n;
vector temp;
//storing the elements of the array till k places
for(int i = 0; i < k; i++) {
temp.push_back(nums[i]);
}
//shifting by k places
for(int i = k; i
Подробнее здесь: [url]https://stackoverflow.com/questions/78651876/rotate-array-right-by-k-places-brute-force[/url]