The right way to Take a Ten Minute Stroll in C

The problem

You reside within the metropolis of Cartesia the place all roads are specified by an ideal grid. You arrived ten minutes too early to an appointment, so that you determined to take the chance to go for a brief stroll. Town offers its residents with a Stroll Producing App on their telephones — everytime you press the button it sends you an array of one-letter strings representing instructions to stroll (eg. [‘n’, ‘s’, ‘w’, ‘e’]). You at all times stroll solely a single block for every letter (route) and you understand it takes you one minute to traverse one metropolis block, so create a operate that can return true if the stroll the app offers you’ll take you precisely ten minutes (you don’t need to be early or late!) and can, in fact, return you to your start line. Return false in any other case.

Be aware: you’ll at all times obtain a sound array containing a random assortment of route letters (‘n’, ‘s’, ‘e’, or ‘w’ solely). It would by no means provide you with an empty array (that’s not a stroll, that’s standing nonetheless!).

The answer in C

Possibility 1:

#embrace <stdbool.h>

bool isValidWalk(const char *stroll) {
  if (strlen(stroll) != 10) return 0;
  
  int h = 0, v = 0;
  whereas(*stroll) {
    change(*stroll) {
      case 'n': ++v; break;
      case 's': --v; break;
      case 'e': ++h; break;
      case 'w': --h; break;
    }
    ++stroll;
  }
  return h == 0 && v == 0;
}

Possibility 2:

#embrace <stdbool.h>

bool isValidWalk(const char *stroll) {
     int i=0, north_south=0, vest_est=0; 
     for(; i< stroll[i]; i++){
       if(stroll[i] == 'n' ) north_south++;
       if(stroll[i] == 's' ) north_south--;
       if(stroll[i] == 'e' ) vest_est++;
       if(stroll[i] == 'w' ) vest_est--;
        
     }
     if(i==10 && north_south==0 && vest_est==0) return true; else return false;
}

Possibility 3:

#embrace <stdbool.h>

bool isValidWalk(const char *stroll) {

   char* c = stroll;
   int up, proper, rely;
   up = proper = rely = 0;
   whereas( *c !='' ){
     change(*c){
       case 'n':
         rely++;
         up++;
         break;
       case 's':
         rely++;
         up--;
         break;
       case 'e':
         rely++;
         proper++;
         break;
       case 'w':
         rely++;
         right--;
         break;
     
     }
     c++;    
   }
   return up == 0 && proper == 0 && rely == 10;
}

Take a look at circumstances to validate our resolution

#embrace <criterion/criterion.h>
#embrace <stdbool.h>
#embrace <stdlib.h>
#embrace <time.h>

void tester(char *twalk, bool anticipated);

Take a look at(Fixed_Tests, should_return_true_for_a_valid_walk) {
  tester("nsnsnsnsns", true);
  tester("ewewnsnsew", true);
  tester("nsewnsewns", true);
  tester("sewnnsewns", true);
}

Take a look at(Fixed_Tests, should_return_false_if_walk_is_too_short) {
  tester("n", false);
  tester("ns", false);
}

Take a look at(Fixed_Tests, should_return_false_if_walk_is_too_long) {
  tester("nsnsnsnsnsns", false);
  tester("nsewnsewnsewnsew", false);
  tester("nsnsnsnsnsewewewewew", false);
}

Take a look at(Fixed_Tests, should_return_false_if_walk_does_not_bring_you_back_to_start) {
  tester("nsnsnsnsnn", false);
  tester("eeewnsnsew", false);
}

static bool resolution(const char *swalk) {
    int i=0, n=0, e=0, w=0, s=0;
    whereas(*swalk) {
        char present = *swalk++;
        if(present == 'n') n++; else
        if(present == 'e') e++; else
        if(present == 'w') w++; else
        if(present == 's') s++; i++;
    }
    return i == 10 && n == s && w == e;
}

static char* getWalk(size_t steps) {
    char *gwalk = (char*) malloc((steps + 1) * sizeof(char));
    if(steps == 10) {
        const char* legitimate[6] = {"nnnnnsssss", "nnnnewssss", "nnneewwsss",
                                "nneeewwwss", "neeeewwwws", "eeeeewwwww"};
        const char information[4] = {'n', 'e', 'w', 's'};
        strcpy(gwalk, legitimate[rand() % 6]);
        if(rand() % 2) {
            gwalk[rand() % 10] = information[rand() % 4];
        }
    }
    else {
        size_t i = 0;
        char n_e[2] = {'n', 'e'};
        char w_s[2] = {'w', 's'};
        for(; i<steps; i++) {
            if(rand() % 2) {
                gwalk[i] = n_e[rand() % 2];
            }
            else {
                gwalk[i] = w_s[rand() % 2];
            }
        }
        gwalk[i] = '';
    }
    return gwalk;
}

Take a look at(Random_Tests, should_pass_all_the_tests_provided) {
    srand(time(NULL));

    int rely = 100;
    whereas(count--) {
        int minutes[25] = {10,10,10,8,10,10,10,1,10,10,10,2,10,
                           10,10,9,10,10,10,11,10,10,10,100,10};
        int rand_mins = minutes[rand() % 25];
        char *rand_walk = getWalk(rand_mins);
        int reply = resolution(rand_walk);
        tester(rand_walk, reply);
        free(rand_walk); rand_walk = NULL;
    }
}