java语言版本

Author: ORainn

problems/0392.判断子序列.md

@@ -140,8 +140,29 @@ public:
 ## 其他语言版本
 
 
-Java：
-
+Java:
+```
+class Solution {
+    public boolean isSubsequence(String s, String t) {
+        int length1 = s.length(); int length2 = t.length();
+        int[][] dp = new int[length1+1][length2+1];
+        for(int i = 1; i <= length1; i++){
+            for(int j = 1; j <= length2; j++){
+                if(s.charAt(i-1) == t.charAt(j-1)){
+                    dp[i][j] = dp[i-1][j-1] + 1;
+                }else{
+                    dp[i][j] = dp[i][j-1];
+                }
+            }
+        }
+        if(dp[length1][length2] == length1){
+            return true;
+        }else{
+            return false;
+        }
+    }
+}
+```
 
 Python：
 ```python