1 """ 2 Given a binary tree, find its maximum depth. 3 The maximum depth is the number of nodes along the longest path from the root node down to the ...
分类：
其他好文 时间：
2020-02-02 23:16:12
阅读次数：
93
Given a binary tree . Split the binary tree into two subtrees by removing 1 edge such that the product of the sums of the subtrees are maximized. Sinc ...
分类：
其他好文 时间：
2020-02-02 15:59:08
阅读次数：
110
用了python的set。为了效率，先做了预处理，并排序了。要注意，排序完才好预处理，否则i，j会对不上。 class Solution: def maxProduct(self, words: List[str]) -> int: maxProd = 0 words = sorted(words, ...
分类：
其他好文 时间：
2020-02-01 21:34:23
阅读次数：
75
分析： 完整代码： // 最长公共子序列 #include <stdio.h> #include <algorithm> using namespace std; const int N = 100; char A[N], B[N]; int dp[N][N]; int main() { freop ...
分类：
其他好文 时间：
2020-02-01 14:15:10
阅读次数：
61
题目描述Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1... ...
分类：
其他好文 时间：
2020-02-01 12:30:58
阅读次数：
94
In the computer world, use restricted resource you have to generate maximum benefit is what we always want to pursue. For now, suppose you are a domin ...
分类：
编程语言 时间：
2020-01-31 12:43:32
阅读次数：
85
Maximum sum AC_Code 1 #include <iostream> 2 #include <cstdio> 3 #include <string> 4 #include <cstring> 5 #include <string> 6 #include <cmath> 7 #inclu ...
分类：
其他好文 时间：
2020-01-31 12:29:11
阅读次数：
73
As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some ro ...
分类：
其他好文 时间：
2020-01-31 12:10:59
阅读次数：
88
From: Stanford University; Jure Leskovec, citation 6w+; Problem: subsequence clustering. Challenging: discover patterns is challenging because it requ ...
分类：
其他好文 时间：
2020-01-31 10:28:33
阅读次数：
101
