lc-3180

登录后复制

public int maxTotalReward(int[] rewardValues) {
    int n = rewardValues.length;
    Arrays.sort(rewardValues);
    int max = rewardValues[n - 1];
    int[] dp = new int[max];
    dp[0] = 1;
    int ans = 0;
    for (int i = 0; i < n; i++) {
        int C = rewardValues[i];
        for (int j = C -1; j >= 0; j--) {
            if (dp[j] != 0) {
               int cur = j + C;
                ans = Math.max(cur, ans);
                if (cur < max) {
                    dp[cur] = 1;
                }
            }
        }
    }
    return ans;
}

• 1.
• 2.
• 3.
• 4.
• 5.
• 6.
• 7.
• 8.
• 9.
• 10.
• 11.
• 12.
• 13.
• 14.
• 15.
• 16.
• 17.
• 18.
• 19.
• 20.
• 21.

原创作者: u_14066730 转载于: https://blog.51cto.com/u_14066730/11289834