xinyu04

摘要： Given the root of a binary tree and an integer targetSum, return the number of paths where the sum of the values along the path equals targetSum. The 阅读全文

摘要： 1. Smooth and strongly convex functions: \(O(\log(1/\epsilon))\) steps \(\large\textbf{Theorem 3.5}\): $f:dom(f) \rightarrow \mathbb{R} $ convex and d 阅读全文

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