题:一个花坛# 是花坛 . 是地面,问花坛的周长显然是枚举每个 # 的周围 . 的数量再相加但是边界写起来有点烦。我们可以边上扩充一圈,然后用子矩阵求解。可以求解所有与四周有关的格子的问题。eliphatfs - OverviewYou can't perform that action at this time. You signed in with another tab or window. You signed out in another tab or window. Reload to refresh your session. Reload to refresh your session.https://github.com/eliphatfs给了下面的解法利用列表相关可以更优雅地求解