摘要:
javaO(N) /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */ class So 阅读全文
摘要:
题目描述: 方法一:动态规划+二分搜索O(knlogn) O(kn) class Solution: def superEggDrop(self, K: int, N: int) -> int: memo = {} def dp(k, n): if (k, n) not in memo: if n 阅读全文