xinyu04

摘要： Given a triangle array, return the minimum path sum from top to bottom. For each step, you may move to an adjacent number of the row below. More forma 阅读全文

摘要： There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites where prerequisites[i 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： 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 阅读全文

摘要： You are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to th 阅读全文

摘要： Given a string s, return the longest palindromic substring in s. Solution 设 \(dp[i][j]\) 表示字串 \(s[i,...,j]\) 是否为回文串。初始化时，每个单独的字符本身就是回文串；长度为2的串只要首尾相同，也 阅读全文

摘要： You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money. Return 阅读全文