xinyu04

导航

2022年6月1日 #

LeetCode 343 Integer Break 数学

摘要: Given an integer n, break it into the sum of k positive integers, where \(k\geq 2\), and maximize the product of those integers. Return the maximum pr 阅读全文

posted @ 2022-06-01 15:52 Blackzxy 阅读(11) 评论(0) 推荐(0) 编辑

LeetCode 513 Find Bottom Left Tree Value BFS

摘要: Given the root of a binary tree, return the leftmost value in the last row of the tree. Solution 要求出最后一层最左边的节点的值。做法很简单,首先判断是不是最后一层,如果不是,则将该层节点的子节点都 \( 阅读全文

posted @ 2022-06-01 03:35 Blackzxy 阅读(12) 评论(0) 推荐(0) 编辑

Deep Learning Week8 Notes

摘要: 1. Computer Vision Task Error rate: \(P(f(X)\neq Y)\) Accuracy: \(P(f(X)=Y)\) \(\textbf{Balanced error rate (BER)}\): \(\frac{1}{C}\sum_{y=1}^CP(f(X)\ 阅读全文

posted @ 2022-06-01 03:17 Blackzxy 阅读(16) 评论(0) 推荐(0) 编辑