题目1：

java">class Solution {
    public int longestCommonSubsequence(String text1, String text2) {
        int[][] dp = new int[text1.length()+1][text2.length()+1];
        for (int i=0;i<dp.length;i++){
            dp[i][0]=0;
        }
        for (int j=0;j<dp[1].length;j++){
            dp[0][j]=0;
        }
        for (int i=1;i<=text1.length();i++){
            for (int j=1;j<=text2.length();j++){
                if (text1.charAt(i-1)==text2.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]);
                }
            }
        }
        return dp[text1.length()][text2.length()];
    }
}

题目2:

java">class Solution {
    public int maxUncrossedLines(int[] nums1, int[] nums2) {
        int[][] dp = new int[nums1.length+1][nums2.length+1];
        for (int i=0;i<dp.length;i++){
            dp[i][0]=0;
        }
        for (int j=0;j<dp[0].length;j++){
            dp[0][j]=0;
        }
        for (int i=1;i<dp.length;i++){
            for (int j=1;j<dp[0].length;j++){
                if (nums1[i-1]==nums2[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]);
                }
            }
        }
        return dp[nums1.length][nums2.length];
    }
}

题目3：

java">class Solution {
    public int maxSubArray(int[] nums) {
        int[] dp = new int[nums.length];
        dp[0]=nums[0];
        int result=Integer.MIN_VALUE;
        for (int i=1;i<nums.length;i++){
          dp[i]=Math.max(dp[i-1]+nums[i],nums[i]);
        }
        for (int i=0;i<nums.length;i++){
          result=Math.max(result,dp[i]);
        }
        return result;
    }
}