剑指offer基础版 --- 第24天

class Solution {
    
    public int cuttingRope(int n) {
    
        int[] dp = new int[n + 1];
        dp[2] = 1;
        for(int i = 3; i <= n; i++){
    
            for(int j = 2; j < i; j++){
    
                dp[i] = Math.max(dp[i],Math.max(j * (i - j),j * dp[i - j]));
            }
        }
        return dp[n];
    }
}

class Solution {
    
    public int[][] findContinuousSequence(int target) {
    
        int i = 1, j = 2, s = 3;
        List<int[]> res = new ArrayList<>();
        while(i < j) {
    
            if(s == target) {
    
                int[] ans = new int[j - i + 1];
                for(int k = i; k <= j; k++)
                    ans[k - i] = k;
                res.add(ans);
            }
            if(s >= target) {
    
                s -= i;
                i++;
            } else {
    
                j++;
                s += j;
            }
        }
        return res.toArray(new int[res.size()][]);
    }
}

class Solution {
    
    public int lastRemaining(int n, int m) {
    
        int ans = 0;
        // 最后一轮剩下2个人，所以从2开始反推
        for (int i = 2; i <= n; i++) {
    
            ans = (ans + m) % i;
        }
        return ans;
    }
}