Leetcode最长系列

最长公共前缀

 public String longestCommonPrefix (String[] strs) {
        if(strs == null || strs.length == 0) return "";
        String res = strs[0];
        
        for(String s : strs){
            while(!s.startsWith(res)){
                if(res.length() == 0) return "";
                res = res.substring(0, res.length() - 1);
            }
        }
        return res;
    }

最长回文子串

暴力

 public String longestPalindrome(String s) {
        int start = 0;
        int end = 0;
        int max = -1;
        for(int i = 0; i < s.length(); i++){
            for(int j = i; j < s.length(); j++){
                if(isTrue(s.substring(i , j + 1)) && (j - i + 1) > max){
                    max = j - i + 1;
                    start = i;
                    end = j;
                }
            }
        }
        return s.substring(start, end + 1);
    }
    private boolean isTrue(String s){
        int i = 0;
        int j = s.length() - 1;
        while(i < j){
            if(s.charAt(i) != s.charAt(j)){
                return false;
            }
            i++;
            j--;
        }
        return true;
    }

动态规划

最大连续子数组的和

public int maxsumofSubarray (int[] arr) {
        int[] dp = new int[arr.length];
        dp[0] = arr[0];
        int res = arr[0];
        for(int i = 1; i < arr.length; i++){
            if(dp[i - 1] > 0){
                dp[i] = dp[i - 1] + arr[i]; 
            }else{
                dp[i] = arr[i];
            }
            res = Math.max(res, dp[i]);
        }
        return res;
    }

最长递增子序列（输出个数）

public int lengthOfLIS(int[] nums) {
        if(nums.length == 0) return 0;
        int[] dp = new int[nums.length];
        int res = 0;
        Arrays.fill(dp, 1);
        
        for(int i = 0; i < nums.length; i++){      
            for(int j = 0; j < i; j++){
                if(nums[j] < nums[i]){
                    dp[i] = Math.max(dp[i], dp[j] + 1);
                }
            }         
            res = Math.max(dp[i], res);
        }
        return res;
    }

最长递增子序列（输出具体子序列）

最长公共子序列（输出个数）

 public int longestCommonSubsequence(String s1, String s2) {
          int dp[][] = new int[text1.length() + 1][text2.length() + 1];
          for(int i = 1; i <= text1.length(); i++){
              char c1 = text1.charAt(i - 1);
              for(int j = 1; j <= text2.length(); j++){
                  char c2 = text2.charAt(j - 1);
                  if(c1 != c2){
                      dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
                  }else{
                      dp[i][j] = dp[i - 1][j - 1] + 1;
                  }
              } 
          }  
          return dp[text1.length()][text2.length()];
    }

最长公共子序列（输出具体子序列）

在上面的基础上往回找

public String LCS (String s1, String s2) {
        // write code here
        int m = s1.length();
        int n = s2.length();
        int[][] dp = new int[m + 1][n + 1];
        for(int i = 1; i <= m; i++){
            for(int j = 1; j <= n; j++){
                if(s1.charAt(i - 1) == s2.charAt(j - 1)){
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                }else{
                    dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
                }
            }
        }
        //倒着找
        StringBuilder sb = new StringBuilder();
        int i = m;
        int j = n;
        while(i != 0 && j != 0){
            if(s1.charAt(i - 1) == s2.charAt(j - 1)){
                sb.append(s1.charAt(i- 1));
                i--;
                j--;
            }else{
                if(dp[i - 1][j] > dp[i][j - 1]){
                    i--;
                }else{
                    j--;
                }
            }
        }
        if(sb.length() == 0) return "-1";
        return sb.reverse().toString();
    }

最长公共子串（输出个数）

public int getLCS(String s, String t){
        int m = s.length();
        int n = t.length();
        int[][] dp = new int[m][n];
        int res = 0;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (s.charAt(i) == s.charAt(j)){
                    if (i == 0 || j == 0){
                        dp[i][j] = 1;
                    }else {
                        dp[i][j] = dp[i - 1][j - 1] + 1;
                        res = Math.max(res, dp[i][j]);
                    }
                }else {
                    dp[i][j] = 0;
                }
            }
        }
        return  res;
    }

最长公共子串（输出具体子串）

public String LCS (String str1, String str2) {
       if(str1 == null || str2 == null) return "-1";
        int maxLength = 0;//最长公共子串长度
        int maxIndex = 0;//最长公共子串最后一个元素的下标值
        int[][] dp = new int[str1.length()][str2.length()];
        
        for(int i = 0; i < str1.length(); i++) {
            for(int j = 0; j < str2.length(); j++) {
                //相等时才要操作
                if(str1.charAt(i) == str2.charAt(j)){
                    if(i == 0 || j == 0) {
                        dp[i][j] = 1;
                    }
                    else{
                        dp[i][j] = dp[i - 1][j - 1] + 1;
                    }
                    if(dp[i][j] > maxLength) {
                        maxLength = dp[i][j];
                        maxIndex = i;
                    }
                }
            }
        }
        return maxLength == 0 ? "-1" : str1.substring(maxIndex-maxLength + 1, maxIndex + 1);
        
    }