Leetcode: Combination Sum IV

Given an integer array with all positive numbers and no duplicates, find the number of possible combinations that add up to a positive integer target.

Example:

nums = [1, 2, 3]
target = 4

The possible combination ways are:
(1, 1, 1, 1)
(1, 1, 2)
(1, 2, 1)
(1, 3)
(2, 1, 1)
(2, 2)
(3, 1)

Note that different sequences are counted as different combinations.

Therefore the output is 7.

class Solution {
public:
    std::map<int, int> vmap;

    int combinationSum4(vector<int>& nums, int target) {
        if (target < 0) {
            return 0;
        }

        if (target == 0) {
            return 1;
        }

        int result = 0;
        for (int num : nums) {
            int ret = 0;
            if (vmap.find(target-num) != vmap.end()) {
                ret = vmap[target-num];
            } else {
                ret = combinationSum4(nums, target-num);
                vmap[target-num] = ret;
            }

            result += ret;
        }

        return result;
    }
};