摘要：
0 class Solution: def numTrees(self, n: int) -> int: dp = [0] * (n + 1) dp[0] = 1 dp[1] = 1 for i in range(2, n + 1): for j in range(i): dp[i] += dp[j 阅读全文
摘要：
不是我自己做出来的 class Solution(object): def generateTrees(self,n): Listn = [i for i in range(1, n+1)] def gt(List): res = [] if not List: return [None] if l 阅读全文
摘要：
搭建一个简易网络模型： import tensorflow as tf model=tf.keras.Sequential() model.add(tf.keras.layers.Dense(64,input_shape=(20,),activation='relu')) model.add(tf. 阅读全文