DP 经典

Author: h2pl

src/DP/分割整数的最大乘积.java renamed to src/DP/经典/分割整数的最大乘积.java

@@ -1,4 +1,4 @@
-package DP;
+package DP.经典;
 
 /**
  * Created by 周杰伦 on 2018/4/3.

src/DP/经典/最长公共子序列.java

@@ -0,0 +1,18 @@
+package DP.经典;
+
+/**
+ * Created by 周杰伦 on 2018/4/6.
+ */
+public class 最长公共子序列 {
+    public int lengthOfLCS(int[] nums1, int[] nums2) {
+        int n1 = nums1.length, n2 = nums2.length;
+        int[][] dp = new int[n1 + 1][n2 + 1];
+        for (int i = 1; i <= n1; i++) {
+            for (int j = 1; j <= n2; 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[n1][n2];
+    }
+}

src/DP/最长递增子序列.java renamed to src/DP/经典/最长递增子序列.java

@@ -1,4 +1,4 @@
-package DP;
+package DP.经典;
 
 /**
  * Created by 周杰伦 on 2018/4/4.

src/DP/爬楼梯方法总数.java renamed to src/DP/经典/爬楼梯方法总数.java

@@ -1,4 +1,4 @@
-package DP;
+package DP.经典;
 
 /**
  * Created by 周杰伦 on 2018/4/4.

src/DP/矩阵的总路径数.java renamed to src/DP/经典/矩阵的总路径数.java

@@ -1,4 +1,4 @@
-package DP;
+package DP.经典;
 
 /**
  * Created by 周杰伦 on 2018/4/4.

src/DP/矩阵的最小路径和.java renamed to src/DP/经典/矩阵的最小路径和.java

@@ -1,4 +1,4 @@
-package DP;
+package DP.经典;
 
 /**
  * Created by 周杰伦 on 2018/4/4.