import java.util.*;

public class Plane
{
    public final int ROWS = 128;
    public final int COLUMNS = 8;

    public Plane (boolean debug)
    {
        _seats = new Seat[ROWS][COLUMNS];
        _debug = debug;

        for (int i = 0; i < ROWS; i++)
        {
            for (int j = 0; j < COLUMNS; j++)
                _seats[i][j] = null;
        }
    }

    public final void addSeat (Seat s)
    {
        _seats[s.getRow()][s.getColumn()] = s;
    }

    public final Seat getSeat (int row, int column)
    {
        return _seats[row][column];
    }

    public final Vector<Seat> emptySeats ()
    {
        Vector<Seat> blanks = new Vector<Seat>();

        for (int i = 0; i < ROWS; i++)
        {
            for (int j = 0; j < COLUMNS; j++)
            {
                if (_seats[i][j] == null)
                    blanks.add(new Seat(i, j));
            }
        }
        
        return blanks;
    }

    private Seat[][] _seats;
    private boolean _debug;
}
@@ -917,24 +917,385 @@
 nks;%0A    %7D%0A%0A
+    /*%0A     * It will have a unique row number as it's the last one in the plane (of valid seats).%0A     * %0A     * assumes only one!%0A     */%0A%0A    public final Seat emptySeat ()%0A    %7B%0A        Seat theSeat = null;%0A        int%5B%5D rows = new int%5BROWS%5D;%0A%0A        for (int i = 0; i %3C ROWS; i++)%0A        %7B%0A            rows%5Bi%5D = 0;%0A        %7D%0A%0A        return null;%0A    %7D%0A%0A
     private 

Update Plane.java