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.
Loading...
  1. Practice
  2. Data Structures
  3. Arrays
  4. Left Rotation
  5. Discussions

Left Rotation

  • hoseong_a_lee + 1 comment

    I don't know where to put my solution...

    • limpingandroid + 1 comment

      I saw this was different than the other problems. I put it in the bottom of main, using n, d and a.

      Are you using C? There appears to be a bug in the original code in their loop that builds a. This is my fix to their problem:

      // bug in original code - only check endptr if we need to do another loop
//      if (a_item_endptr == a_item_str || *a_item_endptr != '\0') { exit(EXIT_FAILURE); }
if (a_item_endptr == a_item_str) { exit(EXIT_FAILURE); }

if (i < (n-1))
{
    if (*a_item_endptr != '\0') { exit(EXIT_FAILURE); }
}
*(a + i) = a_item;
      • limpingandroid + 0 comments

        And here is my solution in C, avoiding any actual rotation and the time and possibly memory hit that would incur:

        for (int j = 0; j < n; j++)
{
    if (j+d < n)
        printf ("%d ",*(a+j+d));
    else
        printf ("%d ",*(a+j-(n-d)));
}
printf("\n");