最大化间隔

def maximal_square(matrix: list[list[int]]) -> int:    rows = len(matrix)    cols = len(matrix[0])    maximum_size = 0    for row in range(rows):        if len(matrix[row]) != cols:            raise valueerror("row %s has the wrong number of columns", row)

    for row in range(rows):        for col in range(cols):            if matrix[row][col] == 1:                max_side = min(rows-row, cols-col)                size = find_square_from_point(matrix, row, col, max_side)                if size > maximum_size:                    maximum_size = size    return maximum_size

. b c db b c dc c c dd d d d

def find_square_from_point(matrix, x: int, y: int, max_side: int) -> int:    side = 1    for s in range(1, max_side):        all_ones = true        for i in range(s+1):            if matrix[x+i][y+s] == 0 or matrix[x+s][y+i] == 0:                all_ones = false                break        if not all_ones:            break        side += 1    return side ** 2

$ ./ch-1.py "[[1, 0, 1, 0, 0],[1, 0, 1, 1, 1],[1, 1, 1, 1, 1],[1, 0, 0, 1, 0]]"4$ ./ch-1.py "[[0, 1],[1, 0]]"1$ ./ch-1.py "[[0]]"0

def right_interval(intervals: list[list[int]]) -> list:    best_intervals = []    for i in intervals:        # calculate the right interval for this interval        end_i = i[1]        lowest_j = none        index_j = -1        for j in range(len(intervals)):            start_j = intervals[j][0]            if start_j >= end_i:                if lowest_j is none or start_j < lowest_j:                    # this is the best matching interval                    lowest_j = start_j                    index_j = j        best_intervals.append(index_j)    return best_intervals

$ ./ch-2.py 3 4 2 3 1 2[-1, 0, 1]$ ./ch-2.py 1 4 2 3 3 4[-1, 2, -1]$ ./ch-2.py 1 2[-1]$ ./ch-2.py 1 4 2 2 3 4[-1, 1, -1]