题目: 题解:
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 # 翻转左半部分到其…
1143. 最长公共子序列
class Solution {public int longestCommonSubsequence(String text1, String text2) {int n text1.length();int m text2.length();int[][] f new int[n 1][m 1];for(int i 1; i < n; i){for(int j 1; j < m; j){if( text1.charAt(i - 1) …