面试题之删除倒数第n个节点
https://leetcode.cn/problems/remove-nth-node-from-end-of-list 思路:先搞两个距离为n的节点,然后让两个节点保持距离同时向后遍历,当后面那个...
Cache of the Internet.
https://leetcode.cn/problems/remove-nth-node-from-end-of-list 思路:先搞两个距离为n的节点,然后让两个节点保持距离同时向后遍历,当后面那个...
https://leetcode.cn/problems/maximum-subarray 方法1: 由于任意一个连续子数组都可以用两个累计和相减算出来,所以可以在算累计和的过程中,维护一个之前已经算...
渐近表示法 渐近上界 \( T(N) = O(f(N)) \) if there are positive constants \( c \) and \( n_0 \) such that \( T...
等价关系(Equivalence Relations) An equivalence relation is a relation R that satisfies three properties:...
通过fibonacci数列的递推公式,可以将求数列转换为求递推矩阵的n次幂。 \begin{equation}{\left[ \begin{array}{cc}0 & 1 \\1 & ...
近期评论