Leetcode-928 Minimize Malware Spread II(尽量减少恶意软件的传播 II)

class Solution
{
    private:
        int visited[309];
        int nowKilled;
        int numOfNode;
        int toBeDeleted;
    public:
        void DFS(int killer,vector<vector<int>> &graph)
        {
            visited[killer] = 1;
            nowKilled ++;
            for(int i = 0; i < numOfNode; i ++)
            {
                if(graph[killer][i] && !visited[i])
                {
                    DFS(i,graph);
                }
            }
        }
        int minMalwareSpread(vector<vector<int>>& graph, vector<int>& initial)
        {
            memset(visited,0,sizeof(visited));
            numOfNode = graph.size();
            int nowLeastKilled = numOfNode+1,result;
            vector<int> killerList(numOfNode,0);
            for(auto d:initial)
                killerList[d] = 1;
            sort(initial.begin(),initial.end());
            for(auto killer:initial)
            {
                toBeDeleted = killer;
                for(int k = 0; k < numOfNode; k ++)
                {
                    visited[k] = 0;
                }
                nowKilled = 0;

                for(int k = 0; k < numOfNode; k ++)
                {
                    if(k != toBeDeleted && !visited[k] && killerList[k])
                    {
                        DFS(k,graph);
                    }
                }
                if(nowKilled < nowLeastKilled)
                {
                    nowLeastKilled = nowKilled;
                    result = toBeDeleted;
                }

            }
            return result;
        }
};