Last Moment Before All Ants Fall Out

class Solution {
    public int getLastMoment(int n, int left[], int right[]) {
        // Find maximum distance for ants moving left (from their position to left edge)
        int maxLeftDistance = 0;
        for (int position : left)
            maxLeftDistance = Math.max(maxLeftDistance, position);

        // Find maximum distance for ants moving right (from their position to right
        // edge)
        int maxRightDistance = 0;
        for (int position : right)
            maxRightDistance = Math.max(maxRightDistance, n - position);

        // The last ant to fall will be the one with the maximum distance to travel
        return Math.max(maxLeftDistance, maxRightDistance);
    }
}