leetcode---Combination Sum II

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.

Each number in C may only be used once in the combination.

Note:
All numbers (including target) will be positive integers.
Elements in a combination (a1, a2, … , ak) must be in non-descending order. (ie, a1 ≤ a2 ≤ … ≤ ak).
The solution set must not contain duplicate combinations.
For example, given candidate set 10,1,2,7,6,1,5 and target 8,
A solution set is:
[1, 7]
[1, 2, 5]
[2, 6]
[1, 1, 6]

class Solution {
public:
    vector<vector<int>> ans;
    int visit[100000];

    void dfs(vector<int>& candidates, int target, int depth, int sum, vector<int> tmp)
    {
        if(sum > target)
            return;
        if(sum == target)
        {
            ans.push_back(tmp);
            return;
        }
        for(int i=depth; i<candidates.size(); i++)
        {
            if(!visit[i])
            {
                tmp.push_back(candidates[i]);
                visit[i] = 1;
                dfs(candidates, target, i, sum+candidates[i], tmp);
                tmp.pop_back();
                visit[i] = 0;
                while(i<candidates.size()-1 && candidates[i] == candidates[i+1])
                    i++;
            }
        }
    }

    vector<vector<int>> combinationSum2(vector<int>& candidates, int target) 
    {
        vector<int> tmp;
        memset(visit, 0, sizeof(visit));
        sort(candidates.begin(), candidates.end());
        dfs(candidates, target, 0, 0, tmp);
        return ans;
    }
};