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) …
题目: 题解:
class Solution {public int largestPalindrome(int n) {if (n 1) {return 9;}int upper (int) Math.pow(10, n) - 1;int ans 0;for (int left upper; ans 0; --left) { // 枚举回文数的左半部分long p left;for (int x left; x >…