求最长不重复字串长度,最长公共字串长度,最长公共子序列长队:
思路:
最长不重复字串长度:当我们发现重复的字符时,我们可以立即跳过这些字符。原因是如果s[j]在索引j的范围[i,j)中具有重复,重复的这个索引为j’,我们不需要一点一点地增加i。 我们可以跳过[i,j’]范围内的所有元素,直接令i=j’+ 1。
private static int lengthOfLongestSubstring(String s) {
int n = s.length(), ans = 0;
Map<Character, Integer> map = new HashMap<>(); // current index of character
// try to extend the range [i, j]
for (int j = 0, i = 0; j < n; j++) {
if (map.containsKey(s.charAt(j))) {
i = Math.max(map.get(s.charAt(j)), i);
}
ans = Math.max(ans, j - i + 1);
map.put(s.charAt(j), j + 1);
}
return ans;
}
最长公共子序列长度:
private static int lcsOfString(String str1,String str2){
int len1 = str1.length();
int len2 = str2.length();
int c[][] = new int[len1+1][len2+1];
for (int i = 0; i <= len1; i++) {
for( int j = 0; j <= len2; j++) {
if(i == 0 || j == 0) {
c[i][j] = 0;
} else if (str1.charAt(i-1) == str2.charAt(j-1)) {
c[i][j] = c[i-1][j-1] + 1;
} else {
c[i][j] = Math.max(c[i - 1][j], c[i][j - 1]);
}
}
}
return c[len1][len2];
}
最长公共子串长度:
private static int dpOfString(String str1,String str2){
int len1 = str1.length();
int len2 = str2.length();
int result = 0; //记录最长公共子串长度
int c[][] = new int[len1+1][len2+1];
for (int i = 0; i <= len1; i++) {
for( int j = 0; j <= len2; j++) {
if(i == 0 || j == 0) {
c[i][j] = 0;
} else if (str1.charAt(i-1) == str2.charAt(j-1)) {
c[i][j] = c[i-1][j-1] + 1;
result = Math.max(c[i][j], result);
} else {
c[i][j] = 0;
}
}
}
return result;
}