摘要： package leetcode; public class offer_14_1 { public int cuttingRope(int n) { int max=1; int[] dp=new int[n+1]; //当n≤3时，不符合动态规划 if(n<=3) { return Math.m 阅读全文

摘要： package leetcode; import java.util.ArrayList; import java.util.List; public class offer_57_2 { public int[][] findContinuousSequence(int target) { int 阅读全文