摘要: 130 被围绕的区域 boolean[][] flag; char[][] bod; int deep,width; public void solve(char[][] board) { if (board.length == 0){ return; } deep = board.length; 阅读全文
posted @ 2021-03-04 18:50 雨落寒沙 阅读(81) 评论(0) 推荐(0)