gistfile1.txt

class Solution {
public:

    void reverse(vector<int> &nums, int start, int end){
        while(start < end){
            swap(nums[start], nums[end]);
            start++;
            end--;
        }

    }
    void rotate(vector<int>& nums, int k) {
        k = k%nums.size(); // to get the actual rotation pattern
        //brute force
         int n = nums.size();
        // vector<int> temp(k);
        //  // first move the last k elements to temp (since we are doing a right shift)
        //  for(int i = 0; i < k; i++){

        //     temp[i] = nums[(n-k)+ i];
        //     cout << temp[i] << endl;
        //  }

        //  for(const auto &elem : nums){
        //     cout << elem << " " << endl;
        //  }
        //  // now shift the first n-k elements of the input vector to the back of the array
        //  for(int i = 0 ; i < n-k; i++){
        //     cout << n-k-1 << " + " << i << " = " << nums[n-k-1 + i] << endl;
        //     cout << nums[i] << endl;
        //     nums[n-k-1 + i] = nums[i];
        //  }
        //  // now copy back the contents of temp at the front of the arrya(since we are doing a right shift)
        //  for(int i = 0; i < k; i++){
        //     nums[i] =  temp[i];
        //  }
        //optimal solution 
        reverse(nums, 0, n-1);
         for(const auto &elem : nums){
             cout << elem << " " << endl;
          }
        reverse(nums, 0, k-1);
        reverse(nums, k, n-1);
    }
};

I am unable to get my brute force solution to work, need help with that.