[Leetcode] 每日两题 36 129 -day108

这段时间重温一下C++编程

36. 有效的数独

哈希，通过统计行、列、格子 中1-9的个数，若超过一个就返回False

row(i,j) i表示第几行 j表示1-9 是否已经存在

class Solution:
    def isValidSudoku(self, board: List[List[str]]) -> bool:
        
        row = [[0]*9 for _ in range(9)] 
        col = [[0]*9 for _ in range(9)] 
        trg = [[0]*9 for _ in range(9)] 

        for i in range(9):
            for j in range(9):
                if board[i][j] !='.':
                    num = (i//3)*3 +j//3
                    if  row[i][int(board[i][j])-1] or col[j][int(board[i][j])-1] or trg[num][int(board[i][j])-1]:
                        return False
                    else :
                        row[i][int(board[i][j])-1],col[j][int(board[i][j])-1],trg[num][int(board[i][j])-1]= 1,1,1
        return True

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        int row[9][9]={0};
        int col[9][9]={0};
        int trg[9][9]={0};
  
        for(int i =0;i<9;i++){
            for (int j =0;j<9;j++){
                if (board[i][j] !='.'){
                    int num = int(i/3)*3+j/3;
                    int id = board[i][j]-'0'-1;
                    if (row[i][id] or col[j][id] or trg[num][id])
                        return false;
                    else {
                        row[i][id]=1;
                        col[j][id]=1;
                        trg[num][id]=1;
                    }
                }
            }
        }
        return true;
    }
};

129. 求根节点到叶节点数字之和

深度优先搜索

积累当前累计值，到下一个节点时 值*10+当前节点的值

class Solution:
    def sumNumbers(self, root: TreeNode) -> int:
        
        def dfs(node,val):
            if not node:
                return 0
            if not node.left and not node.right :
                return val*10+node.val
            return dfs(node.left,val*10+node.val)+dfs(node.right,val*10+node.val)
        
        return dfs(root,0)

class Solution {
public:
    int dfs(TreeNode* node,int val){
        if (node == NULL)
            return 0;
        else if (node->left==NULL and node->right==NULL)
            return 10*val +node->val;
        else
            return dfs(node->left,10*val+node->val)+dfs(node->right,10*val+node->val);
    }
    int sumNumbers(TreeNode* root) {
        return dfs(root,0);
    }
};