摘要:
package com.bupt.acm.leetcode;public class SurroundedRegions { public void solve(char[][] board){ boolean up,down,left,right; for(int i=1;i<board.length-1;i++){ for(int j=1;j<board[0].length-1;j++){ up=down=left=right=false; if(board[i][j]=='... 阅读全文
posted @ 2014-04-06 16:55
曹守鑫
阅读(203)
评论(0)
推荐(0)

浙公网安备 33010602011771号