xinyu04

导航

2022年5月16日 #

LeetCode 130 Surrounded Regions 连通块DFS

摘要: Given an m x n matrix board containing 'X' and 'O', capture all regions that are 4-directionally surrounded by 'X'. A region is captured by flipping a 阅读全文

posted @ 2022-05-16 20:51 Blackzxy 阅读(28) 评论(0) 推荐(0) 编辑

LeetCode 129 Sum Root to Leaf Numbers DFS

摘要: You are given the root of a binary tree containing digits from 0 to 9 only. Each root-to-leaf path in the tree represents a number. For example, the r 阅读全文

posted @ 2022-05-16 19:13 Blackzxy 阅读(13) 评论(0) 推荐(0) 编辑

LeetCode 98 Validate Binary Search Tree DFS

摘要: Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: The left subtree of a node co 阅读全文

posted @ 2022-05-16 06:14 Blackzxy 阅读(12) 评论(0) 推荐(0) 编辑

Deep Learning Week6 Notes

摘要: 1. Benefits of depth \(\text{Consider ReLU MLPs with a single Input/Output, there exists a network }f\) \(\text{ with }D^* \text{ layers, and }2D^* \t 阅读全文

posted @ 2022-05-16 02:54 Blackzxy 阅读(23) 评论(0) 推荐(0) 编辑

LeetCode 104 Maximum Depth of Binary Tree DFS

摘要: Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root n 阅读全文

posted @ 2022-05-16 01:31 Blackzxy 阅读(13) 评论(0) 推荐(0) 编辑