377. Combination Sum IV (Medium)

class Solution {
    public int combinationSum4(int[] nums, int target) {
        int[] maximum = new int[target + 1];
        maximum[0] = 1;
        Arrays.sort(nums);
        //求解顺序的完全背包问题时，对物品的迭代应该放在最里层。
        for (int i = 1; i <= target; i++) {
            for (int j = 0; j < nums.length && nums[j] <= i; j++) {
                maximum[i] += maximum[i - nums[j]];
            } 
        }
        return maximum[target];
    }
}