力扣刷题
optisystem15
上班中
展开
-
力扣-- 最长回文子串
int n = s.length(); boolean[][] dp = new boolean[n][n]; String ans = ""; for (int L = 0; L < n; ++L) { for (int i = 0; i + L < n; ++i) { int j = i + L; if (L == 0) { .原创 2020-10-29 21:26:06 · 100 阅读 · 0 评论 -
力扣--无重复字符的最长字串
暴力法class Solution { public int lengthOfLongestSubstring(String s) { int MAXL = 0; for(int i = 0;i<s.length();i++){ HashSet<Character> set = new HashSet<>(); for(int j=i;j<s.length();j++){原创 2020-10-28 19:09:35 · 94 阅读 · 0 评论