86. Circular Buffer Read

Back To All Submissions
Previous Submission
Next Submission

Code

#include <stdio.h>

typedef struct {
    int buffer[10];
    int head;
    int tail;
    int count;
    int capacity;
} CircularBuffer;

bool isEmpty(CircularBuffer *cb) {
    return (cb->count <= 0);
}

int popVal(CircularBuffer *cb) {
    int val = cb->buffer[cb->tail];
    cb->tail = (cb->tail + 1) % cb->capacity;
    --cb->count;
    return val;
}

void read_bytes(CircularBuffer *cb, int n) {
    // Your logic here
    int tempTail = cb->tail;
    for(int i = tempTail; i < n + tempTail; ++i) {
        if(isEmpty(cb)) {
            if(i != n + tempTail -1)
                printf("NULL ");
            else
                printf("NULL");
        }
        else 
        {
            if(i != n + tempTail -1)
                printf("%d ", popVal(cb));
            else
                printf("%d", popVal(cb));
        }
    }
    printf("\nTail: %d", cb->tail);
}

int main() {
    CircularBuffer cb = {
        .buffer = {10, 20, 30, 40, 50, 60, 70, 80, 90, 100},
        .head = 3,
        .tail = 7,
        .count = 6,
        .capacity = 10
    };

    int n;
    scanf("%d", &n);
    read_bytes(&cb, n);

    return 0;
}

Solving Approach

 

 

 

Was this helpful?
Upvote
Downvote