We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Practice
  2. Tutorials
  3. Cracking the Coding Interview
  4. Arrays: Left Rotation
  5. Discussions

Arrays: Left Rotation

  • venom1724 + 0 comments

    Indeed, its not in-place at all. Also its slow. If you are interested, here's an inplace c++ solution 

    void rotLeft(vector<int> &a, int d) {
    int c=a[d],ci=0,n=a.size(); a[d]=0;
    for(int i=n-1;i>=0;i--){
        swap(a[ci],c);
        if(!c&&i) ci+=n-i+++i;
        ci=(n+ci-d)%n;
    }
}