------
## 最终结论
```python
def least_bricks(wall):
    edge_count = {}
    for row in wall:
        width_sum = 0
        for brick in row[:-1]:  # Exclude the last brick to avoid counting the wall's edge
            width_sum += brick
            if width_sum in edge_count:
                edge_count[width_sum] += 1
            else:
                edge_count[width_sum] = 1

    # Find the maximum edge count
    max_edges = max(edge_count.values(), default=0)
    
    # Calculate the minimum number of bricks crossed
    return len(wall) - max_edges
```