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. Prepare
  2. Algorithms
  3. Implementation
  4. Circular Array Rotation
  5. Discussions

Circular Array Rotation

  • vishalbty
     + 1 comment

    No need to create a new array.

    You can calculate the originalIndex of the given newIndex and just print a[originalIndex].

    I'm not a java developer. So I don't know the syntax properly. But the answer will most likely be something like this.

    static int[] circularArrayRotation(int[] a, int k, int[] queries)

  {
    int[] result = new int[queries.length];
    int l = a.length;
    int index = 0;
    k = k%l;
    for (int i = 0;i<a.length;i++,index++) {
      int queryIndex = queries[i];
      int originIndex;
      if (queryIndex<k) {
        originIndex = l-k+queryIndex;
      }
      else {
        originIndex = queryIndex-k;
      }
      result[index] = a[originIndex];
    }
    return result;
  }