Structuring the Document - Hacker Rank Solution
The true problem here is to write function from string. Let's write some assisting functions , and . They all will take some substring of the original string as a parameter. You can pass the substring itself, however, in order to save time and memory, two indices are recommended instead: the index of the original string where the substring begins and the index of the original string where the substring ends.
All of these functions are written quite similar, so let's look at the pattern of writing them:
- Let's find out, how many items do we have for the current container. In order to do this, let's count the number of delimeters ( '\n', '.' or ' ') in the substring provided. The number of items is equal to the number of delimeters with the notable exception for sentences where it's equal to the number of '.' exactly.
- Now we can allocate memory for the container required. Both and will do the thing with the only notable difference in signature.
- Let's traverse the substring one more time. This time we use a generator for the type of the items in the container (e.g. if we are creating paragraph, then we'll use for each sentence found out). Store the last index the delimeter was seen and when you meet delimeter one more time, you already know the beginning and the end of a new substring to process.
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#define MAX_CHARACTERS 1005
#define MAX_PARAGRAPHS 5
struct word {
char* data;
};
struct sentence {
struct word* data;
int word_count;//denotes number of words in a sentence
};
struct paragraph {
struct sentence* data ;
int sentence_count;//denotes number of sentences in a paragraph
};
struct document {
struct paragraph* data;
int paragraph_count;//denotes number of paragraphs in a document
};
struct word get_word(char* text, int beg, int end) {
struct word answer;
answer.data = calloc(end - beg + 2, sizeof(char));
int index = 0;
int i;
for (i = beg; i <= end; i++)
answer.data[index++] = text[i];
answer.data[index] = 0;
return answer;
}
struct sentence get_sentence(char* text, int beg, int end) {
struct sentence answer;
answer.word_count = 1;
int i;
for (i = beg; i <= end; i++)
if (text[i] == ' ')
++answer.word_count;
answer.data = calloc(answer.word_count, sizeof(struct word));
int start = beg;
int index = 0;
for (i = beg; i <= end; i++)
if (text[i] == ' ')
{
answer.data[index++] = get_word(text, start, i - 1);
start = i + 1;
}
answer.data[index] = get_word(text, start, i - 1);
return answer;
}
struct paragraph get_paragraph(char* text, int beg, int end) {
struct paragraph answer;
answer.sentence_count = 0;
int i;
for (i = beg; i <= end; i++)
if (text[i] == '.')
++answer.sentence_count;
answer.data = calloc(answer.sentence_count, sizeof(struct sentence));
int start = beg;
int index = 0;
for (i = beg; i <= end; i++)
if (text[i] == '.')
{
answer.data[index++] = get_sentence(text, start, i - 1);
start = i + 1;
}
return answer;
}
struct document get_document(char* text) {
struct document answer;
answer.paragraph_count = 1;
int i;
for (i = 0; text[i]; i++)
if (text[i] == '\n')
++answer.paragraph_count;
answer.data = calloc(answer.paragraph_count, sizeof(struct paragraph));
int start = 0;
int index = 0;
for (i = 0; text[i]; i++)
if (text[i] == '\n')
{
answer.data[index++] = get_paragraph(text, start, i - 1);
start = i + 1;
}
answer.data[index] = get_paragraph(text, start, i - 1);
return answer;
}
struct word kth_word_in_mth_sentence_of_nth_paragraph(struct document Doc, int k, int m, int n) {
return Doc.data[n - 1].data[m - 1].data[k - 1];
}
struct sentence kth_sentence_in_mth_paragraph(struct document Doc, int k, int m) {
return Doc.data[m - 1].data[k - 1];
}
struct paragraph kth_paragraph(struct document Doc, int k) {
return Doc.data[k - 1];
}
void print_word(struct word w) {
printf("%s", w.data);
}
void print_sentence(struct sentence sen) {
for(int i = 0; i < sen.word_count; i++) {
print_word(sen.data[i]);
if (i != sen.word_count - 1) {
printf(" ");
}
}
}
void print_paragraph(struct paragraph para) {
for(int i = 0; i < para.sentence_count; i++){
print_sentence(para.data[i]);
printf(".");
}
}
void print_document(struct document doc) {
for(int i = 0; i < doc.paragraph_count; i++) {
print_paragraph(doc.data[i]);
if (i != doc.paragraph_count - 1)
printf("\n");
}
}
char* get_input_text() {
int paragraph_count;
scanf("%d", ¶graph_count);
char p[MAX_PARAGRAPHS][MAX_CHARACTERS], doc[MAX_CHARACTERS];
memset(doc, 0, sizeof(doc));
getchar();
for (int i = 0; i < paragraph_count; i++) {
scanf("%[^\n]%*c", p[i]);
strcat(doc, p[i]);
if (i != paragraph_count - 1)
strcat(doc, "\n");
}
char* returnDoc = (char*)malloc((strlen (doc)+1) * (sizeof(char)));
strcpy(returnDoc, doc);
return returnDoc;
}
int main() {
char* text = get_input_text();
struct document Doc = get_document(text);
int q;
scanf("%d", &q);
while (q--) {
int type;
scanf("%d", &type);
if (type == 3){
int k, m, n;
scanf("%d %d %d", &k, &m, &n);
struct word w = kth_word_in_mth_sentence_of_nth_paragraph(Doc, k, m, n);
print_word(w);
}
else if (type == 2) {
int k, m;
scanf("%d %d", &k, &m);
struct sentence sen= kth_sentence_in_mth_paragraph(Doc, k, m);
print_sentence(sen);
}
else{
int k;
scanf("%d", &k);
struct paragraph para = kth_paragraph(Doc, k);
print_paragraph(para);
}
printf("\n");
}
}
No comments:
Post a Comment