class Solution {public int longestCommonSubsequence(String text1, String text2) {char[] char1 = text1.toCharArray();char[] char2 = text2.toCharArray();int[][] dp = new int[text1.length()+1][text2.length()+1];for(int i = 1; i <= text1.length(); i++){for(int j = 1; j <= text2.length(); j++){if(char1[i-1] == char2[j-1]){dp[i][j] = dp[i-1][j-1] + 1;}else{dp[i][j] = Math.max(dp[i][j-1], dp[i-1][j]);}}}return dp[text1.length()][text2.length()];}
}

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

class Solution {public int maxSubArray(int[] nums) {if(nums.length == 0){return 0;}int res = nums[0];int[] dp = new int[nums.length];dp[0] = nums[0];for(int i = 1; i < nums.length; i++){dp[i] = Math.max(dp[i-1] + nums[i], nums[i]);res = Math.max(res, dp[i]);}return res;}
}