c-first-steps

Index Commits Files Refs README

commit c4ef276ba0952ea9b69525acb278025b762b5f1d
parent 78f23ef2d0f89275f45a19803fa34933a4133398
Author: Martin J. Klöckner <martin.cachari@gmail.com>
Date:   Tue, 24 Nov 2020 22:30:44 -0300

Improved ex18.c source code by removing <string.h> library, and erasing
unnecessary lines, making it more compact;

Diffstat:
M
95.11/guia03/ex18.c
 | 
16
++++++++--------

1 file changed, 8 insertions(+), 8 deletions(-)
diff --git a/95.11/guia03/ex18.c b/95.11/guia03/ex18.c
@@ -3,7 +3,6 @@
 
 #include <stdio.h>
 #include <ctype.h>
-#include <string.h>
 
 #define MAX_LEN 100
 
@@ -11,8 +10,8 @@
 int main ( void ) {
 
     char str[MAX_LEN];
-    int aux, i, j;
-    
+    int aux, len, i, j;
+
     if(fgets(str, MAX_LEN, stdin) == NULL)
         return 1;
 
@@ -22,7 +21,7 @@ int main ( void ) {
             str[i] = tolower(str[i]);
 
 //    If the readed string it's a sentence erases all
-//    the blank spaces;
+//    the blank spaces, between the words;
     for(i = 0; str[i] != '\0'; i++) {
         if(str[i] == ' ') {
             aux = i;
@@ -37,8 +36,10 @@ int main ( void ) {
     for(i = 0; str[i] != '\n'; i++)
         ;
 
-//    We subtract one from i because of the '\n' char;
-    i = i - 1;
+//    Stored the lengh of the string for later, 
+//    and subtract one from i because of the last char;
+    len = i;
+    i = (i - 1);
 
 //    This part compares one by one the chars from the 
 //    string, first with last, second with before last,
@@ -47,11 +48,10 @@ int main ( void ) {
     for(j = 0; (str[j] == str[i]) && (str[j] != '\0'); j++, i--)
         ;
 
-
 //    If the string or sentence its palindrome, then in the previous
 //    block j would end with the value of the total lengh, minus one
 //    because of the last char;
-    if(j == (strlen(str) - 1))
+    if(j == len)
         printf("La cadena es capicua.\n");
 
     return 0;