Last Moment Before All Ants Fall Out of a Plank - Problem

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int max(int a, int b) {
    return a > b ? a : b;
}

int solution(int n, int* left, int leftSize, int* right, int rightSize) {
    int maxTime = 0;
    
    // For ants moving left, time to fall = current position
    for (int i = 0; i < leftSize; i++) {
        maxTime = max(maxTime, left[i]);
    }
    
    // For ants moving right, time to fall = n - current position
    for (int i = 0; i < rightSize; i++) {
        maxTime = max(maxTime, n - right[i]);
    }
    
    return maxTime;
}

int main() {
    int n;
    scanf("%d", &n);
    
    // Read and parse left array
    char leftStr[1000];
    scanf(" %s", leftStr);
    int left[100], leftSize = 0;
    if (strcmp(leftStr, "[]") != 0) {
        char* token = strtok(leftStr + 1, ",]");
        while (token != NULL) {
            left[leftSize++] = atoi(token);
            token = strtok(NULL, ",]");
        }
    }
    
    // Read and parse right array
    char rightStr[1000];
    scanf(" %s", rightStr);
    int right[100], rightSize = 0;
    if (strcmp(rightStr, "[]") != 0) {
        char* token = strtok(rightStr + 1, ",]");
        while (token != NULL) {
            right[rightSize++] = atoi(token);
            token = strtok(NULL, ",]");
        }
    }
    
    printf("%d\n", solution(n, left, leftSize, right, rightSize));
    return 0;
}