79. Word Search

    public static boolean exist(char[][] board, String word) {
        if(board == null || board.length == 0) {
            return false;
        }
        boolean res = false;
        for(int i = 0; i < board.length && !res; i++) {
            for(int j = 0; j < board[0].length  && !res; j++) {
                if(word.charAt(0) == board[i][j]){
                    String temp = "";
                    int[] path = new int[word.length()+1];
                    res = justify(board,i,j,temp,word,path,0);
                }
            }
        }
        return res;
    }

    public static boolean justify(char[][] board, int rolStart, int colStart, String res,String word, int[] path, int count) {
        if(count>0 && word.charAt(count) != board[rolStart][colStart]) {
            return false;
        }
        for(int i = 0; i < count; i++) {
            if(path[i] == (rolStart * board[0].length+colStart)) {
                return false;
            }
        }
        path[count++] = rolStart * board[0].length+colStart;
        res += board[rolStart][colStart];
        if(res.equals(word)) {
            return true;
        }else if(res.length() < word.length()) {
            boolean b1 = false;
            boolean b2 = false;
            boolean b3 = false;
            boolean b4 = false;
            boolean succ = b1;
            if(!succ && colStart+1 < board[0].length) {
                b1 = justify(board,rolStart,colStart+1,res,word,path,count);
            }
            succ = b1;
            if(!succ && colStart-1>=0) {
                b2 = justify(board,rolStart,colStart-1,res,word,path,count);
            }
            succ = b1 || b2;
            if(!succ && rolStart-1 >=0) {
                b3 = justify(board,rolStart-1,colStart,res,word,path,count);    
            }
            succ = b1 || b2 || b3;
            if(!succ && rolStart+1 < board.length) {
                b4 = justify(board,rolStart+1,colStart,res,word,path,count);
            }
            return b1 || b2 || b3 || b4;
        }else {
            return false;
        }
    }
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值