题目: 题解:
class Solution {public int maxSumSubmatrix(int[][] matrix, int k) {int ans Integer.MIN_VALUE;int m matrix.length, n matrix[0].length;for (int i 0; i < m; i) { // 枚举上边界int[] sum new int[n];for (int j i; j <…
题目: 题解:
class Solution:def countNumbersWithUniqueDigits(self, n: int) -> int:if n 0:return 1if n 1:return 10res, cur 10, 9for i in range(n - 1):cur * 9 - ires curreturn res