leetcode 39. Combination Sum

class Solution {
    
    
    void comSum(vector<int> &candidates,vector<vector<int>> &result,int s, vector<int> temp, int target)
    {
        if(target==0)
        {
           result.push_back(temp);
            return;
        }
             
        for(int i=s;i<candidates.size();i++)
        {
            if(candidates[i]<=target)
            {
                temp.push_back(candidates[i]);
                
                cout<<candidates[i]<<endl;
                cout<<target<<endl;
            //    int t=temp.size();
             //   temp[t]=candidates[i];
                comSum(candidates, result,s, temp,target-candidates[i]);
                temp.pop_back();
                    
            }
            if(candidates[i]>target)
                return;
            s=s+1;
        }
    }
public:
    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(),candidates.end());
        vector<vector<int>> result;
        vector<int> temp;
       comSum(candidates,result,0, temp, target); 
        return result;
    }
};