leetcode word search

class Solution {
public:
    bool exist(vector<vector<char>>& board, string word) {
        if(board.size()==0) return false;
        if(word.length()==0) return false;
        vector<vector<bool>> visited(board.size(),vector<bool>(board[0].size(),false));
        for(int i=0;i<board.size();i++){
            for(int j=0;j<board[0].size();j++){
                    if(dfs(i,j,0,board,visited,word)){return true;}
            }
        }
        return false;
        
    }
    bool dfs(int row,int col,int cur,vector<vector<char>>& board,vector<vector<bool>>& visited,string word){
        if(row>=0&&row<board.size()&&col>=0&&col<board[0].size()&&!visited[row][col]&&board[row][col]==word[cur]){
            visited[row][col] = true;
            if(cur+1==word.length()){return true;}
            bool res = dfs(row-1,col,cur+1,board,visited,word)||
                    dfs(row+1,col,cur+1,board,visited,word)||
                    dfs(row,col-1,cur+1,board,visited,word)||
                    dfs(row,col+1,cur+1,board,visited,word);
            visited[row][col] = false;
            return res;
        }
        else return false;
        
    }
};