题目描述
给定一个n×mn \times mn×m的网格,网格中有一些障碍物,求从左上角走到右下角最少经过多少次障碍物。
本题属于以下题库,请选择所需题库进行购买
By signing up a CodeFun2000 universal account, you can submit code and join discussions in all online judging services provided by us.
Using your CodeFun2000 universal account