题目: 题解:
class Solution {public double[] medianSlidingWindow(int[] nums, int k) {DualHeap dh new DualHeap(k);for (int i 0; i < k; i) {dh.insert(nums[i]);}double[] ans new double[nums.length - k 1];ans[0] dh.getMedian();for…
题目: 题解:
class Solution:def largestPalindrome(self, n: int) -> int:if n 1:return 9upper 10 ** n - 1for left in range(upper, upper // 10, -1): # 枚举回文数的左半部分p, x left, leftwhile x:p p * 10 x % 10 # 翻转左半部分到其…