C++ || DP ||
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int lengthOfLongestSubsequence(vector<int>& nums, int target) {\n        // sort(nums.begin(),nums.end());\n        vector<int> dp(target + 1, -11);\n        dp[0] = 0;\n        for (auto z : nums) {\n            for (int i = target; i >= z; --i) {\n                if (dp[i - z] != -11) {\n                    dp[i] = max(dp[i], dp[i - z] + 1);\n                }\n            }\n        }\n        return max(dp[target],-1);\n    }\n};\n```
['C++']