mirror of
https://github.com/theoludwig/programming-challenges.git
synced 2024-10-29 22:17:23 +01:00
feat(solutions): add look-and-say-sequence-conway/c/function
This commit is contained in:
parent
b3fb594865
commit
6d30c3defe
@ -0,0 +1,3 @@
|
|||||||
|
# look-and-say-sequence-conway/c/function
|
||||||
|
|
||||||
|
Created by [@Divlo](https://github.com/Divlo) on 30 November 2021.
|
@ -0,0 +1,17 @@
|
|||||||
|
#include "character.h"
|
||||||
|
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <string.h>
|
||||||
|
|
||||||
|
void character_append(char* string, char character) {
|
||||||
|
size_t length = strlen(string);
|
||||||
|
string[length] = character;
|
||||||
|
string[length + 1] = '\0';
|
||||||
|
}
|
||||||
|
|
||||||
|
void character_append_many(char* string, char* characters) {
|
||||||
|
size_t characters_length = strlen(characters);
|
||||||
|
for (size_t index = 0; index < characters_length; index++) {
|
||||||
|
character_append(string, characters[index]);
|
||||||
|
}
|
||||||
|
}
|
@ -0,0 +1,22 @@
|
|||||||
|
#ifndef __CHARACTER__
|
||||||
|
#define __CHARACTER__
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Append a character to a string, assuming string points to an array
|
||||||
|
* with enough space.
|
||||||
|
*
|
||||||
|
* @param string
|
||||||
|
* @param character
|
||||||
|
*/
|
||||||
|
void character_append(char* string, char character);
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Append many characters to a string, assuming string points to an array
|
||||||
|
* with enough space.
|
||||||
|
*
|
||||||
|
* @param string
|
||||||
|
* @param characters
|
||||||
|
*/
|
||||||
|
void character_append_many(char* string, char* characters);
|
||||||
|
|
||||||
|
#endif
|
@ -0,0 +1,19 @@
|
|||||||
|
#include "input.h"
|
||||||
|
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
|
||||||
|
#include "character.h"
|
||||||
|
|
||||||
|
char* input() {
|
||||||
|
char character;
|
||||||
|
size_t length = 1;
|
||||||
|
char* string = malloc(length * sizeof(char));
|
||||||
|
*string = '\0';
|
||||||
|
while ((character = getchar()) != '\n' && character != EOF) {
|
||||||
|
length++;
|
||||||
|
string = realloc(string, length * sizeof(char));
|
||||||
|
character_append(string, character);
|
||||||
|
}
|
||||||
|
return string;
|
||||||
|
}
|
@ -0,0 +1,11 @@
|
|||||||
|
#ifndef __INPUT__
|
||||||
|
#define __INPUT__
|
||||||
|
|
||||||
|
/**
|
||||||
|
* @brief Read a line from stdin.
|
||||||
|
*
|
||||||
|
* @return char*
|
||||||
|
*/
|
||||||
|
char* input();
|
||||||
|
|
||||||
|
#endif
|
@ -0,0 +1,28 @@
|
|||||||
|
#include <stdio.h>
|
||||||
|
#include <stdlib.h>
|
||||||
|
#include <string.h>
|
||||||
|
|
||||||
|
#include "character.h"
|
||||||
|
#include "input.h"
|
||||||
|
|
||||||
|
int main() {
|
||||||
|
char* string = input();
|
||||||
|
size_t string_length = strlen(string);
|
||||||
|
char* result = malloc(sizeof(char*) * (string_length + 1));
|
||||||
|
for (size_t index = 0; index < string_length; index++) {
|
||||||
|
size_t number_of_appearances = 0;
|
||||||
|
char value_to_search = string[index];
|
||||||
|
size_t iteration = index;
|
||||||
|
while (iteration < string_length && string[iteration] == value_to_search) {
|
||||||
|
number_of_appearances++;
|
||||||
|
iteration++;
|
||||||
|
}
|
||||||
|
char* number_of_appearances_string = malloc(sizeof(char*) * (string_length + 1));
|
||||||
|
snprintf(number_of_appearances_string, sizeof(result), "%zu", number_of_appearances);
|
||||||
|
character_append_many(result, number_of_appearances_string);
|
||||||
|
character_append(result, value_to_search);
|
||||||
|
index += number_of_appearances - 1;
|
||||||
|
}
|
||||||
|
printf("%s\n", result);
|
||||||
|
return EXIT_SUCCESS;
|
||||||
|
}
|
@ -18,7 +18,7 @@ namespace Solution
|
|||||||
numberOfAppearances += 1;
|
numberOfAppearances += 1;
|
||||||
iteration++;
|
iteration++;
|
||||||
}
|
}
|
||||||
result = result + numberOfAppearances.ToString() + line[index];
|
result = result + numberOfAppearances.ToString() + valueToSearch;
|
||||||
index += numberOfAppearances - 1;
|
index += numberOfAppearances - 1;
|
||||||
}
|
}
|
||||||
Console.WriteLine(result);
|
Console.WriteLine(result);
|
||||||
|
Loading…
Reference in New Issue
Block a user