diff --git a/src/main/java/dynamic_programming/FindLength.java b/src/main/java/dynamic_programming/FindLength.java
index 32dff82..cd34308 100644
--- a/src/main/java/dynamic_programming/FindLength.java
+++ b/src/main/java/dynamic_programming/FindLength.java
@@ -11,7 +11,6 @@ package dynamic_programming;
  * 链接：https://leetcode.cn/problems/maximum-length-of-repeated-subarray/
  */
 //不会
-
 /**
  * dp[i][j] 的定义是：
  *
@@ -24,6 +23,7 @@ package dynamic_programming;
  * else
  *     dp[i][j] = 0;
  */
+//二刷不会
 public class FindLength {
     public int findLength(int[] nums1, int[] nums2) {
         int n = nums1.length, m = nums2.length;
diff --git a/src/main/java/dynamic_programming/FindLengthOfLCIS.java b/src/main/java/dynamic_programming/FindLengthOfLCIS.java
index 36cfbfc..d7660bd 100644
--- a/src/main/java/dynamic_programming/FindLengthOfLCIS.java
+++ b/src/main/java/dynamic_programming/FindLengthOfLCIS.java
@@ -15,6 +15,7 @@ import java.util.Arrays;
 
  * 链接：https://leetcode.cn/problems/longest-continuous-increasing-subsequence/
  */
+//二刷会做
 public class FindLengthOfLCIS {
     public int findLengthOfLCIS(int[] nums) {
         int sz=nums.length;
diff --git a/src/main/java/dynamic_programming/LongestCommonSubsequence.java b/src/main/java/dynamic_programming/LongestCommonSubsequence.java
index 7b52c3e..901b5e5 100644
--- a/src/main/java/dynamic_programming/LongestCommonSubsequence.java
+++ b/src/main/java/dynamic_programming/LongestCommonSubsequence.java
@@ -13,6 +13,7 @@ package dynamic_programming;
 
  * 链接：https://leetcode.cn/problems/longest-common-subsequence/
  */
+//二刷会做
 public class LongestCommonSubsequence {
     public int longestCommonSubsequence(String text1, String text2) {
         int n=text1.length(),m=text2.length();
diff --git a/src/main/java/dynamic_programming/MaxProfit3.java b/src/main/java/dynamic_programming/MaxProfit3.java
index 65d0f2c..7de4563 100644
--- a/src/main/java/dynamic_programming/MaxProfit3.java
+++ b/src/main/java/dynamic_programming/MaxProfit3.java
@@ -20,7 +20,6 @@ package dynamic_programming;
 public class MaxProfit3 {
     /**
      * 一天一共就有五个状态，
-     *
      * 没有操作 （其实我们也可以不设置这个状态）
      * 第一次持有股票
      * 第一次不持有股票
diff --git a/src/main/java/dynamic_programming/MaxProfit4.java b/src/main/java/dynamic_programming/MaxProfit4.java
index 1d40035..9ee2548 100644
--- a/src/main/java/dynamic_programming/MaxProfit4.java
+++ b/src/main/java/dynamic_programming/MaxProfit4.java
@@ -13,6 +13,7 @@ package dynamic_programming;
  * 链接：https://leetcode.cn/problems/best-time-to-buy-and-sell-stock-iv/
  */
 //不会
+//二刷不会
 public class MaxProfit4 {
 
     public int maxProfit(int k, int[] prices) {
diff --git a/src/main/java/dynamic_programming/MinPathSum.java b/src/main/java/dynamic_programming/MinPathSum.java
index 050adf5..071e114 100644
--- a/src/main/java/dynamic_programming/MinPathSum.java
+++ b/src/main/java/dynamic_programming/MinPathSum.java
@@ -11,6 +11,7 @@ package dynamic_programming;
 
  * 链接：https://leetcode.cn/problems/minimum-path-sum/
  */
+//二刷会做
 public class MinPathSum {
     public int minPathSum(int[][] grid) {
         int r=grid.length;
diff --git a/src/main/java/dynamic_programming/Rob3.java b/src/main/java/dynamic_programming/Rob3.java
index a5da5d2..b329880 100644
--- a/src/main/java/dynamic_programming/Rob3.java
+++ b/src/main/java/dynamic_programming/Rob3.java
@@ -16,6 +16,7 @@ import java.util.*;
 
  * 链接：https://leetcode.cn/problems/house-robber-iii/
  */
+//二刷会做
 public class Rob3 {
     // 1.递归去偷，超时
     public int rob(TreeNode root) {
diff --git a/src/main/java/dynamic_programming/UniquePaths.java b/src/main/java/dynamic_programming/UniquePaths.java
index 8f9a1d9..7b3971c 100644
--- a/src/main/java/dynamic_programming/UniquePaths.java
+++ b/src/main/java/dynamic_programming/UniquePaths.java
@@ -16,6 +16,7 @@ package dynamic_programming;
 
  * 链接：https://leetcode.cn/problems/unique-paths/
  */
+//二刷会做
 public class UniquePaths {
     public static int uniquePaths(int m, int n) {
         int[][] dp = new int[m][n];